Related papers: $\Sigma_1$-Stationary logic as an $\aleph_1$-Abstr…
We introduce $\mu$-Abstract Elementary Classes ($\mu$-AECs) as a broad framework for model theory that includes complete boolean algebras and Dirichlet series, and begin to develop their classification theory. Moreover, we note that…
We prove that every abstract elementary class (a.e.c.) with LST number $\kappa$ and vocabulary $\tau$ of cardinality $\leq \kappa$ can be axiomatized in the logic ${\mathbb L}_{\beth_2(\kappa)^{+++},\kappa^+}(\tau)$. In this logic an a.e.c.…
We study abstract elementary classes (AECs) that, in $\aleph_0$, have amalgamation, joint embedding, no maximal models and are stable (in terms of the number of orbital types). Assuming a locality property for types, we prove that such…
The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by…
This paper continues the study of superstability in abstract elementary classes (AECs) satisfying the amalgamation property. In particular, we consider the definition of $\mu$-superstability which is based on the local character…
We deal with stability theory for ``reasonable'' non-elementary classes without any remanents of compactness (like: above Hanf number or definable by L_{omega_1, omega}).
We give a presentation theorem for continuous first-order logic and Metric Abstract Elementary classes in terms of $L_{\omega_1, \omega}$ and Abstract Elementary Classes, respectively. This presentation is accomplished by analyzing dense…
The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…
We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic…
In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…
In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…
Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…
We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of \emph{arbitrariness}: the more arbitrary…
This paper is part of a program initiated by Saharon Shelah to extend the model theory of first order logic to the non-elementary setting of abstract elementary classes (AECs). An abstract elementary class is a semantic generalization of…
Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…
\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…
Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main…
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…