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.

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 argue that the basic notions of mathematics can only be properly formulated in an informal way. Mathematical notions transcend formalizations and their study involves the consideration of other mathematical notions. We explain the fundamental role of categoricity theorems in making these studies possible. We arrive at the conclusion that the enterprise of mathematics is not infallible and that it ultimately relies on degrees of evidence.

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes. Roughly speaking, these are classes with a closure operator that is essentially algebraic closure (instead of, in the universal case, being essentially definable closure). Along the way, we prove in particular that Galois (orbital) types in multiuniversal classes are determined by their finite restrictions, generalizing a (...) result of the second author. (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)

Kant has argued that moral requirements are categorical. Kant's claim has been challenged by some contemporary philosophers; this article defends Kant's doctrine. I argue that Kant's claim captures the unique feature of moral requirements. The main arguments against Kant's claim focus on one condition that a categorical imperative must meet: to be independent of desires. I argue that there is another important, but often ignored, condition that a categorical imperative must meet, and this second condition is crucial to understanding why (...) moral requirements are not hypothetical. I also argue that the claim that moral requirements are not categorical because they depend on desires for motivation is beside the point. The issue of whether moral requirements are categorical is not an issue about whether moral desires or feelings are necessary for moral motivation but are rather an issue about the ground of moral desires or moral feelings. Moral requirements are categorical because they are requirements of reason, and reason makes moral desires or feelings possible. (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)

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)

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

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)

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.

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)

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)

In Germany, Otfried Höffe has been a leading contributor to debates in moral, legal, political, and social philosophy for close to three decades. Höffe's work, brings into relief the relevance of these German discussions to their counterparts in English-language circles. In this book, originally published in Germany in 1990 and expanded since, Höffe proposes an extended and original interpretation of Kant‚ philosophy of law, and social morality. Höffe articulates his reading of Kant in the context of an account of modernity (...) as a "polyphonous project," in which the dominant themes of pluralism and empiricism are countered by the theme of categorically binding moral principles, such as human rights. Paying equal attention to the nuances of Kant's texts and the character of the philosophical issues in their own right, Höffe ends up with a Kantianism that requires, rather than precludes, a moral anthropology and that questions the fashionable juxtaposition of Kant and Aristotle as exemplars of incompatible approaches to ethical and political thought. (shrink)

Theoria, Volume 87, Issue 4, Page 986-1000, August 2021.

We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures.

Finitely algebraizable deductive systems were introduced by Blok and Pigozzi to capture the essential properties of those deductive systems that are very tightly connected to quasivarieties of universal algebras. They include the equivalential logics of Czelakowski. Based on Blok and Pigozzi’s work, Herrmann defined algebraizable deductive systems. These are the equivalential deductive systems that are also truth-equational, in the sense that the truth predicate of the class of their reduced matrix models is explicitly definable by some set of unary equations. (...) Raftery undertook the task of characterizing the property of truth-equationality for arbitrary deductive systems. In this paper, following Raftery, we extend the notion of truth-equationality for logics formalized as $\pi$-institutions and abstract several of the results that hold for deductive systems in this more general categorical context. (shrink)

We prove Baldwin-Lachlan theorem for local (LS(K)-)tame abstract elementary classes K with disjoint amalgamation property and with LS(K)=ω.

In the paper all countable Boolean algebras with m distinguished. ideals having countably-categorical elementary theory are described and constructed. From the obtained characterization it follows that all countably-categorical elementary theories of Boolean algebras with distinguished ideals are finite-axiomatizable, decidable and, consequently, their countable models are strongly constructivizable.

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)

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

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)

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).

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)

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)

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)

The dispute between Kantians and Humeans over whether practical reason can justify moral reasons for all agents is often characterized as a debate over whether reasons are hypothetical or categorical. Instead, this debate must be understood in terms of the distinction between agent-neutral and agent-relative reasons. This paper considers Alan Gewirth’s Reason and Morality as a case study of a Kantian justification of morality focused on deriving categorical reasons from hypothetical reasons. The case study demonstrates first, the possibility of categorical (...) agent-relative reasons, and second, that inattention to this possibility has caused considerable confusion in the debate between Kantians and Humeans. (shrink)

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)

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)

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.

We develop a general covariant categorical modeling theory of natural systems' behavior based on the fundamental functorial processes of representation and localization-globalization. In the second part of this study we analyze the semantic bidirectional process of localization-globalization. The notion of a localization system of a complex information structure bears a dual role: Firstly, it determines the appropriate categorical environment of base reference contexts for considering the operational modeling of a complex system's behavior, and secondly, it specifies the global compatibility conditions (...) of local contextual information. A localization system acts on the global information structure of a complex system, partitions it into sorts, and eventually, forces the consistent sheaf-theoretic fibering of the latter over the base category of commutative reference contexts. In this manner, the sheafification of the Spectrum functor of a complex information structure takes place by imposing on the uniform and homologous fibered structure of elements of the Spectrum presheaf the following two requirements of coherence in relation to the localization-globalization process: [i]. Compatibility of information under restriction from the global to the local level, and [ii]. Compatibility of information under extension from the local to the global level. Correspondingly, the options of local and global receive a concrete mathematical meaning with respect to a suitable notion of topology (categorical Grothendieck topology) defined on the base category of commutative reference contexts. Finally, the accurate functorial process modeling of a complex system's behavior, respecting the processes of representation and localization-globalization, is being effectuated by means of establishing a categorical dual equivalence between the category of complex information structures, and the topes of sheaves over the base category of partial or local information carriers, equipped with the categorical topology of epimorphosis families. (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 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.

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)

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.

We argue that, if taken seriously, Kripke's view that a language for science can dispense with a negation operator is to be rejected. Part of the argument is a proof that positive logic, i.e., classical propositional logic without negation, is not categorical.

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 give a characterization of the strong degrees of categoricity of computable structures greater or equal to [Formula: see text]. They are precisely the treeable degrees — the least degrees of paths through computable trees — that compute [Formula: see text]. As a corollary, we obtain several new examples of degrees of categoricity. Among them we show that every degree [Formula: see text] with [Formula: see text] for [Formula: see text] a computable ordinal greater than 2 is (...) the strong degree of categoricity of a rigid structure. Using quite different techniques we show that every degree [Formula: see text] with [Formula: see text] is the strong degree of categoricity of a structure. Together with the above example this answers a question of Csima and Ng. To complete the picture we show that there is a degree [Formula: see text] with [Formula: see text] that is not the degree of categoricity of a rigid structure. (shrink)

In this paper we provide a categorical equivalence for the category \ of product algebras, with morphisms the homomorphisms. The equivalence is shown with respect to a category whose objects are triplets consisting of a Boolean algebra B, a cancellative hoop C and a map \ from B × C into C satisfying suitable properties. To every product algebra P, the equivalence associates the triplet consisting of the maximum boolean subalgebra B, the maximum cancellative subhoop C, of P, and the (...) restriction of the join operation to B × C. Although several equivalences are known for special subcategories of \ , up to our knowledge, this is the first equivalence theorem which involves the whole category of product algebras. The syntactic counterpart of this equivalence is a syntactic reduction of classical logic CL and of cancellative hoop logic CHL to product logic, and viceversa. (shrink)

Why do we draw the boundaries between “blue” and “green”, where we do? One proposed answer to this question is that we categorize color the way we do because we perceive color categorically. Starting in the 1950’s, the phenomenon of “categorical perception” (CP) encouraged such a response. CP refers to the fact that adjacent color patches are more easily discriminated when they straddle a category boundary than when they belong to the same category. In this paper, I make three related (...) claims. (1) Although what seems to guide discrimination performances seems to indeed be categorical information, the evidence in favor of the fact that categorical perception infl uences the way we perceive color is not convincing. (2) That CP offers a useful account of categorization is not obvious.While aiming at accounting for categorization, CP itself requires an account of categories. This being said, CP remains an interesting phenomenon. Why and how is our discrimination behavior linked to our categories? It is suggested that linguistic labels determine CP through a naming strategy to which participants resort while discriminating colors. This paper’s fi nal point is (3) that the naming strategy account is not enough. Beyond category labels, what seems to guide discrimination performance is category structure. (shrink)

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic aspects and results from the (...) level of sentential logics to the level of π-institutions. (shrink)

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 from categoricity in λ+ we can get categoricity in all cardinals ≥ λ+ in a χ-tame abstract elementary classe [Formula: see text] which has arbitrarily large models and satisfies the amalgamation and joint embedding properties, provided [Formula: see text] and λ ≥ χ. For the missing case when [Formula: see text], we prove that [Formula: see text] is totally categorical provided that [Formula: see text] is categorical in [Formula: see text] and [Formula: see text].

The age of a structure M is the set of all isomorphism types of finite substructures of M. We study ages of generic expansions of ω-stable ω-categorical structures.

This article proposes to explicate theoretical equivalence by supplementing formal equivalence criteria with preservation conditions concerning interpretation. I argue that both the internal structure of models and choices of morphisms are aspects of formalisms that are relevant when it comes to their interpretation. Hence, a formal criterion suitable for being supplemented with preservation conditions concerning interpretation should take these two aspects into account. The two currently most important criteria—gener-alized definitional equivalence (Morita equivalence) and categorical equivalence—are not optimal in this respect. (...) I put forward a criterion that takes both aspects into account: the criterion of definable categorical equivalence. (shrink)