Related papers: A common Misconception about the Categorical Arith…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
We define the concept of a regular object with respect to another object in an arbitrary category. We present basic properties of regular objects and we study this concept in the special cases of abelian categories and locally finitely…
We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…
Algebraic theories, sometimes called equational theories, are syntactic notions given by finitary operations and equations, such as monoids, groups, and rings. There is a well-known category-theoretic treatment of them that algebraic…
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…
In 1932, G\"odel proved that there is no finite semantics for intuitionistic logic. We consider all fragments of intuitionistic logic and check in each case whether a finite semantics exists. We may fulfill a didactic goal, as little logic…
Epistemic uncertainty arises in lack of complete knowledge about the state of a system. There are multiple mathematical frameworks for measuring such uncertainty quantitatively, often referred to as imprecise probability theories. Inspired…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theorem of Peter Freyd saying that there are no sufficiently…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
This article studies the compatibility of Koenig's notion of an exact Borel subalgebra of a quasi-hereditary or, more generally, standardly stratified algebra with taking idempotent subalgebras or quotients. As an application, we provide…
We extend the notion of exact completion on a weakly lex category to elementary doctrines. We show how any such doctrine admits an elementary quotient completion, which freely adds effective quotients and extensional equality. We note that…
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…
We present a characterization of the completeness of the field of real numbers in the form of a \emph{collection of ten equivalent statements} borrowed from algebra, real analysis, general topology and non-standard analysis. We also discuss…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…