Related papers: The Kim-Pillay theorem for Abstract Elementary Cat…
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…
We examine the use of classes to formulate several categorical notions. This leads to two proposals: an explicit structure for working with subobjects, and a hierarchy of $k$-classes. We apply the latter to both ordinary and higher…
We begin the study of categorical logic for continuous model theory. In particular, we 1. introduce the notions of metric logical categories and functors as categorical equivalents of a metric theory and interpretations, 2. prove a…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
We study simple type theory with primitive equality (STT) and its first-order fragment EFO, which restricts equality and quantification to base types but retains lambda abstraction and higher-order variables. As deductive system we employ a…
We formulate and prove a twofold generalisation of Lie's second theorem that integrates homomorphisms between formal group laws to homomorphisms between Lie groups. Firstly we generalise classical Lie theory by replacing groups with…
The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
In first order logic, it is known that you can define a topology so that the countable models of some theory $T$ form a Polish Space (i.e. completely metrizable second countable space). In this paper we use the Baldwin- Boney Relational…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
In this letter we introduce a generalization of the Knizhnik- Zamolodchikov equations from affine Lie algebras to a wide class of conformal field theories (not necessarily rational). The new equations describe correlations functions of…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
TopKAT is the algebraic theory of Kleene algebra with tests (KAT) extended with a top element. Compared to KAT, one pleasant feature of TopKAT is that, in relational models, the top element allows us to express the domain and codomain of a…
We present a general definition of entropy in the setting of pre-ordered semigroups, extending the notion of topological entropy. From our definition, we obtain the basic properties exhibited by various entropy-like theories encountered in…
Building on previous work, we study the splitting of idempotents in the category of extensions $\mathbb{E}\operatorname{-Ext}(\mathcal{C})$ associated to a pair $(\mathcal{C},\mathbb{E})$ of an additive category and a biadditive functor to…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
We prove: Main Theorem: Let $\mathcal{K}$ be an abstract elementary class satisfying the joint embedding and the amalgamation properties with no maximal models of cardinality $\mu$. Let $\mu$ be a cardinal above the the L\"owenheim-Skolem…
Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the…
We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.