Related papers: $\Sigma_1$-Stationary logic as an $\aleph_1$-Abstr…
A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…
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.
We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a…
We introduce a class of $2d$ sigma models which are parameterized by a function of one variable. In addition to the physical field $g$, these models include an auxiliary field $v_\alpha$ which mediates interactions in a prescribed way. We…
Let $K$ be an algebraically closed field of characteristic $0$, and let $H^{\mu}$ denote the Hilbert scheme of $\mu$ points of the affine space $A^n$. An elementary component $E$ of $H^{\mu}$ is an irreducible component such that every…
Alternating parity automata (APAs) provide a robust formalism for modelling infinite behaviours and play a central role in formal verification. Despite their widespread use, the algebraic theory underlying APAs has remained largely…
Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…
We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg's algebraic approach to characterization results in on judgment…
We exhibit an isomorphism of associative algebras between the $\operatorname{Ext}$-algebra $\operatorname{Ext}_\Lambda^\ast(\Delta,\Delta)$ of standard modules over the dual extension algebra $\Lambda$ of two directed algebras $B$ and $A$…
We consider the problem of learning the semantics of composite algebraic expressions from examples. The outcome is a versatile framework for studying learning tasks that can be put into the following abstract form: The input is a partial…
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…
Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel and choice connectives" built the sound and complete…
This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem: Theorem: Let C be a large homogeneous model of a stable diagram D. Let p, q in S_D(A), where p is…
We develop abstract learning frameworks (ALFs) for synthesis that embody the principles of CEGIS (counter-example based inductive synthesis) strategies that have become widely applicable in recent years. Our framework defines a general…
In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step…
The unit interval in a partially ordered abelian group with order unit forms an interval effect algebra (IEA) which can be regarded as an algebraic model for the semantics of a formal deductive logic. There is a categorical equivalence…