We show that Zilber’s conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in pseudo-exponentiation leads to a description of the elementary embeddings, and the result that pseudo-exponential fields are precisely the models of their common first-order theory which are atomic over exponential transcendence bases. We also show that the class of all pseudo-exponential fields is an example of a nonfinitary abstract elementary (...) class, answering a question of Kesälä and Baldwin. (shrink)

We continue our study of finitary abstract elementary classes, defined in [7]. In this paper, we prove a categoricity transfer theorem for a case of simple finitary AECs. We introduce the concepts of weak κ-categoricity and f-primary models to the framework of א₀-stable simple finitary AECs with the extension property, whereby we gain the following theorem: Let (������, ≼ ������ ) be a simple finitary AEC, weakly categorical in some uncountable κ. Then (������, ≼ ������ ) is weakly categorical in (...) each λ ≥ min { \group{ \{\kappa,\beth_{ \group{ (2^{ \aleph_{ 0 _} ^});^{ + ^} \group} _}\}; \group} . If the class (������, ≼ ������ ) is also LS(������)-tame, weak κ-categoricity is equivalent with κ-categoricity in the usual sense. We also discuss the relation between finitary AECs and some other non-elementary frameworks and give several examples. (shrink)

In this paper we isolate a notion that we call “formalism freeness” from Gödel's 1946 Princeton Bicentennial Lecture, which asks for a transfer of the Turing analysis of computability to the cases of definability and provability. We suggest an implementation of Gödel's idea in the case of definability, via versions of the constructible hierarchy based on fragments of second order logic. We also trace the notion of formalism freeness in the very wide context of developments in mathematical logic in the (...) 20th century. (shrink)

In this paper we study abstract elementary classes with Löwenheim-Skolem number $\kappa$ , where $\kappa$ is cofinal with $\omega$ , which have finite character. We generalize results obtained by Kueker for $\kappa=\omega$ . In particular, we show that $\mathbb{K}$ is closed under $L_{\infty,\kappa}$ -elementary equivalence and obtain sufficient conditions for $\mathbb{K}$ to be $L_{\infty,\kappa}$ -axiomatizable. In addition, we provide an example to illustrate that if $\kappa$ is uncountable regular then $\mathbb{K}$ is not closed under $L_{\infty,\kappa}$ -elementary equivalence.

We investigate properties of accessible categories with directed colimits and their relationship with categories arising from ShelahʼsElementary Classes. We also investigate ranks of objects in accessible categories, and the effect of accessible functors on ranks.

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, the so-called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore, we give an example where the Galois type itself does not have finite character in such a class.

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of a parabolic subgroup. We show that the class of all right-angled Coxeter groups is not smooth and establish some general combinatorial criteria for such classes to be abstract elementary classes (AECs), for them to be finitary, and for them to be tame. We further prove two combinatorial conditions ensuring the strong rigidity of a right-angled Coxeter group of arbitrary rank. The combination of these results translates (...) into a machinery to build concrete examples of AECs satisfying given model-theoretic properties. We exhibit the power of our method by constructing three concrete examples of finitary classes. We show that the first and third classes are nonhomogeneous and that the last two are tame, uncountably categorical, and axiomatizable by a single Lω1,ω-sentence. We also observe that the isomorphism relation of any countable complete first-order theory is κ-Borel reducible (in the sense of generalized descriptive set theory) to the isomorphism relation of the theory of right-angled Coxeter groups whose Coxeter graph is an infinite random graph. (shrink)

We introduce a new device in the study of abstract elementary classes : Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois type of length less than a fixed cardinal κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}. We show:Theorem 0.1 An AEC K is fully \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa = \beth _{\kappa } > \text {LS}$$\end{document}. If K is Galois stable, then the (...) class of κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Galois saturated models of K admits an independence notion \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document}-coheir) which, except perhaps for extension, has the properties of forking in a first-order stable theory. (shrink)