„E o plăcere să citeşti o carte filosofică în care este atât de evidentă preocuparea autorului pentru a se face cât mai bine înţeles, iar rezultatele sunt pe măsura acestei preocupări. Sobrietatea scrierii este, în acest caz, expresia unei onestităţi intelectuale lipsite de cusur. Sunt atribute, din păcate mai rar întâlnite, care constituie apanajul acelora care îşi pot permite să renunţe la orice încercări de a-şi impresiona cititorii prin efecte exterioare. şi aceasta deoarece ei pot convinge pe deplin numai şi (...) numai prin substanţa ideilor şi forţa argumentelor.” Mircea Flonta. (shrink)

Categorical perception (CP) refers to how similar things look different depending on whether they are classified as the same category. Many studies demonstrate that adult humans show CP for human emotional faces. It is widely debated whether the effect can be accounted for solely by perceptual differences (structural differences among emotional faces) or whether additional perceiver-based conceptual knowledge is required. In this review, I discuss the phenomenon of CP and key studies showing CP for emotional faces. I then discuss a (...) new model of emotion which highlights how perceptual and conceptual knowledge interact to explain how people see discrete emotions in others’ faces. In doing so, I discuss how language (emotion words included in the paradigm) contribute to CP. (shrink)

This article considers categorical perception (CP) as a crucial process involved in all sort of communication throughout the biological hierarchy, i.e. in all of biosemiosis. Until now, there has been consideration of CP exclusively within the functional cycle of perception–cognition–action and it has not been considered the possibility to extend this kind of phenomena to the mere physiological level. To generalise the notion of CP in this sense, I have proposed to distinguish between categorical perception (CP) and categorical sensing (CS) (...) in order to extend the CP framework to all communication processes in living systems, including intracellular, intercellular, metabolic, physiological, cognitive and ecological levels. The main idea is to provide an account that considers the heterarchical embeddedness of many instances of CP and CS. This will take me to relate the hierarchical nature of categorical sensing and perception with the equally hierarchical issues of the “binding problem”, “triadic causality”, the “emergent interpretant” and the increasing semiotic freedom observed in biological and cognitive systems. (shrink)

We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable equivalence structures are relatively categorical, (...) we further investigate when they are categorical. We also obtain results on the index sets of computable equivalence structures. (shrink)

Categorical Monism (that is, the view that all fundamental natural properties are purely categorical) has recently been challenged by a number of philosophers. In this paper, I examine a challenge which can be based on Gabriele Contessa’s [10] defence of the view that only powers can confer dispositions. In his paper Contessa argues against what he calls the Nomic Theory of Disposition Conferral (NTDC). According to NTDC, in each world in which they exist, (categorical) properties confer specific dispositions on their (...) bearers; yet, which disposition a (categorical) property confers on its bearers depends on what the (contingent) laws of nature happen to be. Contessa, inter alia, rests his case on an intuitive analogy between cases of mimicking (in which objects do not actually possess the dispositions associated with their displayed behaviour) and cases of disposition conferral through the action of laws. In this paper, I criticize various aspects of Contessa’s argumentation and show that the conclusion he arrives at (that is, only powers can confer dispositions) is controversial. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem (...) for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for (...) the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory. Another great enterprise in contemporary philosophy of mathematics has been Wright's and Hale's project of founding mathematics on abstraction principles. In earlier work, it was noted that one traditional abstraction principle, namely Hume's Principle, had a certain relative categoricity property, which here we term natural relative categoricity. In this paper, we show (...) that most other abstraction principles are not naturally relatively categorical, so that there is in fact a large amount of incompatibility between these two recent trends in contemporary philosophy of mathematics. To better understand the precise demands of relative categoricity in the context of abstraction principles, we compare and contrast these constraints to stability-like acceptability criteria on abstraction principles, the Tarski-Sher logicality requirements on abstraction principles studied by Antonelli and Fine, and supervaluational ideas coming out of Hodes' work. (shrink)

In this paper, we give a classification of ℵ0-categorical coloured linear orders, generalizing Rosenstein's characterization of ℵ0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ℚn-combinations . We give a method using coding trees to describe all structures in our list.

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl( $\emptyset$ )-definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU-rank.

The paper argues against an intuitive reading of the Stone-von Neumann theorem as a categoricity result, thereby pointing out that this theorem does not entail any model-theoretical difference between the theories that validate it and those that don't.

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

Let be an abstract elementary class with amalgamation, and Lowenheim Skolem number LS. We prove that for a suitable Hanf number gc0 if χ0 < λ0 λ1, and is categorical inλ1+ then it is categorical in λ0.

Stephen Mumford, in his book on dispositions, argues that we can distinguish between dispositional and categorical properties in terms of entailing his 'conditional conditionals', which involve the concept of ideal conditions. I aim at defending Mumford's criterion for distinguishing between dispositional and categorical properties. To be specific, no categorical ascriptions entail Mumford's 'conditional conditionals'.

If the theory advanced below is correct, then what is the difference (I know she [Philippa Foot]] will ask) between the moral must/must not and the must/must not of etiquette or the clubhouse? Looking forward to the conclusion I shall reach, let me reply, roughly and readily, that the difference will reside not in anything formal but in the depth, spread, and felt authority of the attachments to which the moral must/must not appeals-and categorically appeals.

Studies of categorical induction typically examine how belief in a premise (e.g., Falcons have an ulnar artery) projects on to a conclusion (e.g., Robins have an ulnar artery). We study induction in cases in which the premise is uncertain (e.g., There is an 80% chance that falcons have an ulnar artery). Jeffrey's rule is a normative model for updating beliefs in the face of uncertain evidence. In three studies we tested the descriptive validity of Jeffrey's rule and a related probability (...) theorem, the rule of total probability. Although these rules provided good approximations to mean judgments in some cases, the results from regression and correlation analyses suggest that participants focus on the parts of these rules that are associated with the highest overall probability. We relate our findings to rational models of judgment. (shrink)

Defining the degree of categoricity of a computable structure ${\mathcal{M}}$ to be the least degree d for which ${\mathcal{M}}$ is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0 (n) can be so realized, as can the degree 0 (ω).

Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness and (...) argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers. (shrink)

Their important exegetical and philosophical disagreements notwithstanding, Pauline Kleingeld and Marcus Willaschek, on the one hand, and Alyssa Bernstein, on the other, seem to agree that Kant’s Categorical Imperative transcends the contemporary dichotomy between moral realism and ethical constructivism. My contribution is an attempt to further elaborate on the third, unique, conceptual option that they have identified. I employ the notion of an “enabling condition,” introduced in epistemology and action theory by Jonathan Dancy, in order to show that the Categorical (...) Imperative enables action and is enabled by action. The Categorical Imperative (as distinct from specific categorical imperatives and moral laws) is discussed as a structural, but still normative, coherence and consistence norm of practical reasoning. As such it is two things at the same time, namely, first, the most fundamental normative background condition of practical deliberation, choice, and action. Second, however, the mutual enabler-enablee-relationship between action and Categorical Imperative points in the other – “not-so-Kantian” – direction as well: individual practical deliberation, understood as the mundane phenomenon that penetrates the lives of agents, is the (existence) condition that enables the Categorical Imperative in normatively-structured action. (shrink)

We investigate effective categoricity of computable Abelian p-groups . We prove that all computably categorical Abelian p-groups are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. We investigate which computable Abelian p-groups are categorical and relatively categorical.

We give an axiomatic framework for the non-modular simple 0-categorical structures constructed by Hrushovski. This allows us to verify some of their properties in a uniform way, and to show that these properties are preserved by iterations of the construction.

In his article 'Rejection' (1996), Timothy Smiley had shown how a logical system allowing rules of rejection could provide a categorical axiomatization of the classical propositional calculus. This paper shows how rules of rejection, when placed in a multiple conclusion setting, can also provide categorical axiomatizations of a range of non-classical calculi which permit truth-value gaps, among them the calculus in Smiley's own 'Sense without denotation' (1960).

The results in this paper are in a context of abstract elementary classes identified by Shelah and Villaveces in which the amalgamation property is not assumed. The long-term goal is to solve Shelah’s Categoricity Conjecture in this context. Here we tackle a problem of Shelah and Villaveces by proving that in their context, the uniqueness of limit models follows from categoricity under the assumption that the subclass of amalgamation bases is closed under unions of bounded, -increasing chains.

This study investigated whether and how a person's varied series of lexical categories corresponding to different discriminatory characteristics of the same colors affect his or her perception of colors. In three experiments, Chinese participants were primed to categorize four graduated colors—specifically dark green, light green, light blue, and dark blue—into green and blue; light color and dark color; and dark green, light green, light blue, and dark blue. The participants were then required to complete a visual search task. Reaction times (...) in the visual search task indicated that different lateralized categorical perceptions of color corresponded to the various priming situations. These results suggest that all of the lexical categories corresponding to different discriminatory characteristics of the same colors can influence people's perceptions of colors and that color perceptions can be influenced differently by distinct types of lexical categories depending on the context. (shrink)

This paper defends the doctrine that moral requirements are categorical in nature. My point of departure is John McDowell’s 1978 essay, “Are Moral Requirements Hypothetical Imperatives?”, in which McDowell argues, against Philippa Foot, that moral reasons are not conditional upon agents’ desires and are, in a certain sense, inescapable. After expounding McDowell’s view, exploring his idea that moral requirements “silence” other considerations and discussing its particularist ethos, I address an objection that moral reasons, as McDowell conceives them, are fundamentally incomplete (...) in ways only a full-bloodedly Kantian appeal to pure practical reason can remedy. I conclude that the objection fails: ordinary moral reasons do not stand in need of a grounding in Reason. There is no prospect of deriving them from a supreme principle of morality or other canons of rationality. Ordinary reasons are sufficient in themselves, though their significance can be elucidated and illuminated by various strategies — some broadly Aristotelian, some drawing inspiration from Kant’s formula of humanity — in ways that can strengthen and vindicate them. Notwithstanding the failure of the objection, I conclude by reflecting on how Kantian insights can yet play a significant role in a McDowellian view of moral deliberation and moral education. (shrink)

Summary We have considered complete consistent systems in the first‐oder predicate calculus with identity, and have studied the set of the models of such a system by means of the maximal consistent condition‐sets associated with the system. The results may be summarized thus: (a) A complete consistent system is no‐categorical (= categorical in the denumerable domain) if and only if for every n, the number of different conditions in n variables is finite (T10). (b) If a complete consistent system has (...) a model M with finite character (i.e. a model M such that every maximal consistent condition‐set satisfied in M has a finite basis), then this model M is uniquely characterized by the property that every other model is an arithmetic extension of M (T 5). (c) Every complete consistent system, which has only a denumerable number of different associated maximal consistent condition‐sets, has a model with finite character (T8). (shrink)

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...) models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

Hellman [2003] raises interesting challenges to categorical structuralism. He starts citing Awodey [1996] which, as Hellman sees, is not intended as a foundation for mathematics. It offers a structuralist framework which could denned in any of many different foundations. But Hellman says Awodey's work is 'naturally viewed in the context of Mac Lane's repeated claim that category theory provides an autonomous foundation for mathematics as an alternative to set theory' (p. 129). Most of Hellman's paper 'scrutinizes the formulation of category (...) theory' specifically in 'its alleged role as providing a foundation' (p. 130). I will also focus on the foundational question. Page numbers in parentheses are page references to Hellman [2003]. (shrink)

This paper is devoted to the proof of the following upward categoricity theorem: Let K be a tame abstract elementary class with amalgamation, arbitrarily large models, and countable Löwenheim-Skolem number. If K is categorical in ‮א‬₁ then K is categorical in every uncountable cardinal. More generally, we prove that if K is categorical in a successor cardinal λ⁺ then K is categorical everywhere above λ⁺.

We explore approximate categoricity in the context of distortion systems, introduced in our previous paper (Hanson in Math Logic Q 69(4):482–507, 2023), which are a mild generalization of perturbation systems, introduced by Yaacov (J Math Logic 08(02):225–249, 2008). We extend Ben Yaacov’s Ryll-Nardzewski style characterization of separably approximately categorical theories from the context of perturbation systems to that of distortion systems. We also make progress towards an analog of Morley’s theorem for inseparable approximate categoricity, showing that if there is some (...) uncountable cardinal $$\kappa$$ such that every model of size $$\kappa$$ is ‘approximately saturated,’ in the appropriate sense, then the same is true for all uncountable cardinalities. Finally we present some examples of these phenomena and highlight an apparent interaction between ordinary separable categoricity and inseparable approximate categoricity. (shrink)

Discussions about dispositional and categorical properties have become commonplace in metaphysics. Unfortunately, dispositionality and categoricity are disputed notions: usual characterizations are piecemeal and not widely applicable, thus threatening to make agreements and disagreements on the matter merely verbal—and also making it arduous to map a logical space of positions about dispositional and categorical properties in which all parties can comfortably fit. This paper offers a prescription for this important difficulty, or at least an inkling thereof. This will be achieved by (...) comparing pairs of positions and exploring their background metaphysics to discover where alleged agreements and disagreements concerning dispositionality and categoricity really lie; more specifically, the Pure Powers view and the Powerful Qualities view will be under scrutiny. Over this background, the prescription functions by isolating a successful identity-based characterization of categoricity, while abandoning the correspondent identity-based characterization of dispositionality. On the contrary, according to this prescription a property is dispositional if and only if it is solely in virtue of possessing that property that its bearer is assigned a certain dispositional profile. A crucial consequence of this prescription is that, while supporters of the Pure Powers view often characterize their position as an essentialist one, the dispositionality of properties needn’t always be a matter of essence. (shrink)

In the paper there are introduced and discussed the concepts of an indexed category with quantifications and a higher level indexed category to present an algebraic characterization of some version of Martin-Löf Type Theory. This characterization is given by specifying an additional equational structure of those indexed categories which are models of Martin-Löf Type Theory. One can consider the presented characterization as an essentially algebraic theory of categorical models of Martin-Löf Type Theory. The paper contains a construction of an indexed (...) category with quantifications from terms and types of the language of Martin-Löf Type Theory given in the manner of Troelstra [11]. The paper contains also an inductive definition of a valuation of these terms and types in an indexed category with quantifications. (shrink)

We prove that each ω-categorical, generically stable group is solvable-by-finite.

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures can possess arbitrarily complex (...) automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

We follow the ideas given by Chen and Grätzer to represent Stone algebras and adapt them for the case of Stonean residuated lattices. Given a Stonean residuated lattice, we consider the triple formed by its Boolean skeleton, its algebra of dense elements and a connecting map. We define a category whose objects are these triples and suitably defined morphisms, and prove that we have a categorical equivalence between this category and that of Stonean residuated lattices. We compare our results with (...) other works and show some applications of the equivalence. (shrink)

Notoriously, the dispositional view of natural properties is thought to face a number of regress problems, one of which points to an epistemological worry. In this paper, I argue that the rival categorical view is also susceptible to the same kind of regress problem. This problem can be overcome, most plausibly, with the development of a structuralist epistemology. After identifying problems faced by alternative solutions, I sketch the main features of this structuralist epistemological approach, referring to graph-theoretic modelling in the (...) process. Given that both the categoricalists and dispositionalists are under pressure to adopt this same epistemological approach in light of the regress problem, this suggests that the categoricalist versus dispositionalist debate is best fought on metaphysical rather than epistemological grounds. (shrink)

We introduce a typed version of the intuitionistic epsilon calculus. We give a categorical semantics of it introducing a class of categories which we call \-categories. We compare our results with earlier ones of Bell :323–337, 1993).

During public health crises including the COVID-19 pandemic, resource scarcity and contagion risks may require health systems to shift—to some degree—from a usual clinical ethic, focused on the well-being of individual patients, to a public health ethic, focused on population health. Many triage policies exist that fall under the legal protections afforded by “crisis standards of care,” but they have key differences. We critically appraise one of the most fundamental differences among policies, namely the use of criteria to categorically exclude (...) certain patients from eligibility for otherwise standard medical services. We examine these categorical exclusion criteria from ethical, legal, disability, and implementation perspectives. Focusing our analysis on the most common type of exclusion criteria, which are disease-specific, we conclude that optimal policies for critical care resource allocation and the use of cardiopulmonary resuscitation (CPR) should not use categorical exclusions. We argue that the avoidance of categorical exclusions is often practically feasible, consistent with public health norms, and mitigates discrimination against persons with disabilities. (shrink)

Categories can affect our perception of the world, rendering between-category differences more salient than within-category ones. Across many studies, such categorical perception has been observed for the basic-level categories of one's native language. Other research points to categorical distinctions beyond the basic level, but it does not demonstrate CP for such distinctions. Here we provide such a demonstration. Specifically, we show CP in English speakers for the non-basic distinction between “warm” and “cool” colors, claimed to represent the earliest stage of (...) color lexicon evolution. Notably, the advantage for discriminating colors that straddle the warm–cool boundary was restricted to the right visual field—the same behavioral signature previously observed for basic-level categories. This pattern held in a replication experiment with increased power. Our findings show that categorical distinctions beyond the basic-level repertoire of one's native language are psychologically salient and may be spontaneously accessed during normal perceptual processing. (shrink)

We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency, etc. Both systems have so far been studied mainly from type-theoretic and category-theoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the (...) appropriate categorical models for these logics. (shrink)

We investigate basic forms of inference involving modal notions and quantifiers, called modal categorical inferences. We do so by extending Quarc, a novel logic that assigns a primary role to quantified phrases, with modalities from the hexagon of opposition. We show that there are two possible readings of de dicto modalities (called symmetric and asymmetric, respectively), as opposed to the unique reading of de re modalities. We focus on the asymmetric reading of de dicto modalities and explore the logical relations (...) that obtain between them. These are proven in a natural deduction system, accompanied by an appropriate syntax and semantics, and graphically represented via a dodecagon of opposition. Moreover, we show that the asymmetric reading, in contrast to the symmetric one, preserves all properties of the hexagon for basic modal notions. Thus, it provides a particularly attractive basis on which to further investigate quantified modal reasoning. (shrink)

We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

Deprivation views of the badness of death are almost universally accepted among those who hold that death can be bad for the person who dies. In their most common form, deprivation views hold that death is bad because (and to the extent that) it deprives people of goods they would have gained had they not died at the time they did. Contrast this with categorical desire views, which hold that death is bad because (and to the extent that) it thwarts (...) people’s categorical desires. Categorical desires are desires that are not conditional upon one being alive; yet provide reason for the agent to continue living to ensure that those very desires are satisfied. I argue that categorical desire views are subject to two serious problems that deprivation views are not. First, categorical desire views entail that it is not bad for someone to not be resuscitated after dying a bad death. Second, categorical desire views cannot account for cases in which it is good to prevent people from coming into existence or cases in which it is good to prevent them from continuing to exist. After considering, and rejecting, various replies on behalf of categorical desire proponents, I conclude that we have good reason to reject categorical desire views in favor of deprivation views. (shrink)

In this paper we present a category equivalent to that of tense Nelson algebras. The objects in this new category are pairs consisting of an IKt-algebra and a Boolean IKt-congruence and the morphisms are a special kind of IKt-homomorphisms. This categorical equivalence permits understanding tense Nelson algebras in terms of the better–known IKt-algebras.

We investigate the computational complexity the class of Γ-categorical computable structures. We show that hyperarithmetic categoricity is Π11-complete, while computable categoricity is Π04-hard.

This paper offers a conceptual clarification of the phenomenon commonly referred to as categorical perception of color, both in adults and in infants. First, I argue against the common notion of categorical perception as involving a distortion of the perceptual color space. The effects observed in the categorical perception research concern categorical discrimination performance and the underlying processing; they need not directly reflect the relations of color similarity and difference. Moreover, the methodology of the research actually presupposes that the relations (...) of similarity and difference do not vary with languages. The observed categorical perception effects should be conceived independently of the perceptual color space. Second, I challenge the usual opinion that the existing evidence on infant “categorical perception” allows us to conclude that infants perceptually categorize color, and in particular, that they have perceptual categories that resemble the basic color categories of English. Such conclusions rest on an unjustified interpretation of the infant “categorical perception” findings in terms of adult linguistic categorical boundaries. Based on the suggested new understanding, I propose that the phenomenon, as present in infants, should be conceived and examined as a possible explanatory factor with respect to the existing patterns of color naming in languages of the world. (shrink)

We prove that every ω-categorical, generically stable group is nilpotent-by-finite and that every ω-categorical, generically stable ring is nilpotent-by-finite.