We build an א₁-categorical but not א₀-categorical theory whose only computably presentable model is the saturated one. As a tool, we introduce a notion related to limitwise monotonic functions.

Shelah has shown that $\aleph_1$-categoricity for Abstract Elementary Classes (AECs) is not absolute in the following sense: There is an example $K$ of an AEC (which is actually axiomatizable in the logic $L(Q)$) such that if $2^{\aleph_0}.

Computable structures of Scott rank ${\omega_1^{CK}}$ are an important boundary case for structural complexity. While every countable structure is determined, up to isomorphism, by a sentence of ${\mathcal{L}_{\omega_1 \omega}}$ , this sentence may not be computable. We give examples, in several familiar classes of structures, of computable structures with Scott rank ${\omega_1^{CK}}$ whose computable infinitary theories are each ${\aleph_0}$ -categorical. General conditions are given, covering many known methods for constructing computable structures with Scott rank ${\omega_1^{CK}}$ , which guarantee that the (...) resulting structure is a model of an ${\aleph_0}$ -categorical computable infinitary theory. (shrink)

Orthogonality of all families of pairwise weakly orthogonal 1-types for ℵ0-categorical weakly o-minimal theories of finite convexity rank has been proved in 6. Here we prove orthogonality of all such families for binary 1-types in an arbitrary ℵ0-categorical weakly o-minimal theory and give an extended criterion for binarity of ℵ0-categorical weakly o-minimal theories . © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Our purpose in this note is to study countable $\aleph_0$-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.

It is shown that the first-order theory $\mathrm{Th}_R(A)$ of a countable module over an arbitrary countable ring $R$ is $\aleph_0$-categorical if and only if $A \cong \bigoplus_{t < n}A_i^{(\kappa_i)}, A_i$ finite, $n \in \omega, \kappa_i \leq \omega$. Furthermore, $\mathrm{Th}_R(A)$ is $\aleph_0$-categorical for all $R$-modules $A$ if and only if $R$ is finite and there exist only finitely many isomorphism classes of indecomposable $R$-modules.

The existence of a countable complete theory with exactly $\aleph_1$ many minimal models is independent of $\mathrm{ZFC} + \neg\mathrm{CH}$.

THEOREM. The Jacobson radical of an $\aleph_0$-categorical associative ring is nilpotent.

It is consistent with $\neg\mathrm{CH}$ that every universal theory of relational structures with the joint embedding property and amalgamation for $\mathscr{P}^-(3)$-diagrams has a universal model of cardinality $\aleph_1$. For classes with amalgamation for $\mathscr{P}^-(4)$-diagrams it is consistent that $2^{\aleph_0} > \aleph_2$ and there is a universal model of cardinality $\aleph_2$.

Let n ≥ 3. The following theorems are proved. Theorem. The theory of the class of strictly upper triangular n × n matrix rings over fields is finitely axiomatizable. Theorem. If R is a strictly upper triangular n × n matrix ring over a field K, then there is a recursive map σ from sentences in the language of rings with constants for K into sentences in the language of rings with constants for R such that $K \vDash \varphi$ if (...) and only if $R \vDash \sigma$. Theorem. The theory of a strictly upper triangular n × n matrix ring over an algebraically closed field is ℵ 1 -categorical. (shrink)

Finitely axiomatizable ℵ 1 categorical theories are locally modular.

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of reals in models (...) of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of reals in models (...) of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

In this paper we prove the equiconsistency of "Every $\omega_1$-tree which is first order definable over has a cofinal branch" with the existence of a $\Pi^1_1$ reflecting cardinal. We also prove that the addition of MA to the definable tree property increases the consistency strength to that of a weakly compact cardinal. Finally we comment on the generalization to higher cardinals.

We give a proof of Hechler's theorem that any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\aleph_1$\end{document}-directed partial order can be embedded via a ccc forcing notion cofinally into \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\omega^\omega$\end{document} ordered by eventual dominance. The proof relies on the standard forcing relation rather than the variant introduced by Hechler.

Category theory has become central to certain aspects of theoretical physics. Bain has recently argued that this has significance for ontic structural realism. We argue against this claim. In so doing, we uncover two pervasive forms of category-theoretic generalization. We call these ‘generalization by duality’ and ‘generalization by categorifying physical processes’. We describe in detail how these arise, and explain their significance using detailed examples. We show that their significance is two-fold: the articulation of high-level physical concepts, and the generation (...) of new models. 1 Introduction2 Categories and Structuralism 2.1 Categories: abstract and concrete 2.2 Structuralism: simple and ontic3 Bain’s Two Strategies 3.1 A first strategy for defending Objectless 3.2 A second strategy for defending Objectless4 Two Forms of Categorical Generalization 4.1 Generalization by duality 4.2 Generalization by categorification 4.3 The role of category theory in physics5 Conclusion. (shrink)

We show that for all natural numbers n, the theory “ZF + DC $_{\aleph_n}$ + $\aleph_{\omega}$ is a Rowbottom cardinal carrying a Rowbottom filter” has the same consistency strength as the theory “ZFC + There exists a measurable cardinal”. In addition, we show that the theory “ZF + $\aleph_{\omega_1}$ is an ω 2-Rowbottom cardinal carrying an ω 2-Rowbottom filter and ω 1 is regular” has the same consistency strength as the theory “ZFC + There exist ω 1 measurable cardinals”. We (...) also discuss some generalizations of these results. (shrink)

We use some notions from computability in an uncountable setting to describe a difference between the “Zilber field” of size ℵ1ℵ1 and the “Zilber cover” of size ℵ1ℵ1.

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ03-condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n≥ 1 in ω, there exists a computable tree of finite height which is δ0n+1-categorical but (...) not δ0n-categorical. (shrink)

We show that if T is a trivial uncountably categorical theory of Morley Rank 1 then T is model complete after naming constants for a model.

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.

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.

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)

We introduce a new approach to the model theory of metric structures by defining the notion of a metric abstract elementary class (MAEC) closely resembling the notion of an abstract elementary class. Further we define the framework of a homogeneous MAEC were we additionally assume the existence of arbitrarily large models, joint embedding, amalgamation, homogeneity and a property which we call the perturbation property. We also assume that the Löwenheim-Skolem number, which in this setting refers to the density character of (...) the set instead of the cardinality, is ${\aleph_0}$ . In these settings we prove an analogue of Morley’s categoricity transfer theorem. We also give concrete examples of homogeneous MAECs. (shrink)

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)

1. A categorical requirement is a requirement that applies regardless of inclination. You might wonder whether you could escape the reach of a categorical requirement by flying the skull and cross-bones and renouncing altogether the aim of belonging to the moral community. But what we are apt to think is that categorical requirements such as moral requirements apply to you even if you ignore them and try to renounce every concern whatever.