Related papers: Introduction to: classification theory for abstrac…
We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…
We present a setting for the study of torsion theories in general categories. The idea is to associate, with any pair ($\mathcal T$, $\mathcal F$) of full replete subcategories in a category $\mathcal C$, the corresponding full subcategory…
We lift the SCL calculus for first-order logic without equality to the SCL(T) calculus for first-order logic without equality modulo a background theory. In a nutshell, the SCL(T) calculus describes a new way to guide hierarchic resolution…
In classification, it is usual to observe that models trained on a given set of classes can generalize to previously unseen ones, suggesting the ability to learn beyond the initial task. This ability is often leveraged in the context of…
Positive logic is a generalisation of full first-order logic that does not have negation built in. Still, many model-theoretic ideas, tools and techniques work perfectly fine in positive logic. Importantly, there is a compactness theorem.…
Category theory provides a powerful tool to organize mathematics. A sample of this descriptive power is given by the categorical analysis of the practice of "classes as shorthands" in ZF set theory. In this case category theory provides a…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…
We give a classification of nullity classes (or torsion classes) in an abelian category by forming a spectrum of equivalence classes of premonoform objects. This is parallel to Kanda's classification of Serre subcategories.
Algebraic hyperstructures represent a natural extension of classical algebraic structures. In a classical algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
We give an informal introduction to model categories, and treat three important examples in some details: the category of small categories, the category of dg algebras, and the category of small dg categories.
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…