According to the argumentative theory of reasoning, humans have evolved reasoning abilities (usually known as ‘system 2’ or ‘analytic’ reasoning) for argumentative purposes. This implies that some reasoning skills should be universals. Such a claim seems to be at odd with findings from cross-cultural research. First, a wealth of research, following the work of Luria, has shown apparent difficul...

Moral particularists and generalists alike have struggled over how to incorporate the role of moral salience in ethical reasoning. In this paper, I point neglected resources Kant account for maxim formation: Kant's theory reflective judgment. tasks judgment with picking out salient empirical particulars formation into maxims, associating it purposiveness, or intentional activity (action on ends...

Humans routinely generalize universal relationships to unfamiliar instances. If we are told "if glork then frum," and "glork," we can infer "frum"; any name that serves as the subject of a sentence can appear as the object of a sentence. These universals are pervasive in language and reasoning. One account of how they are generalized holds that humans possess mechanisms that manipulate symbols ...

Since Greenberg the recognition of linguistic universals has been the backbone of language typology. Earlier Garvin had already divided universals into absolute and potential ones, the former uncontested cornerstones of linguistic theory, the latter commonly accepted generalizations among experienced professionals. The 'universals' to be discussed here are of the latter type: tried and tested p...

This document consists of three papers: \Virtual Relations", by Dale Jacquette; a reply, \Virtual Universals", by William J.

Instead of the half-century old foundational feud between set theory and category theory, this paper argues that they are theories about two different complementary types of universals. The set-theoretic antinomies forced naïve set theory to be reformulated using some iterative notion of a set so that a set would always have higher type or rank than its members. Then the universal uF = {x | F (...