Related papers: The Geometric Completion of a Doctrine
We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…
Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…
It is a well-known fact that although the poset of open sets of a topological space is a Heyting algebra, its Heyting implication is not necessarily stable under the inverse image of continuous functions and hence is not a geometric…
We develop a homotopy theory for additive categories endowed with endofunctors, analogous to the concept of a model structure. We use it to construct the homotopy theory of a Hovey triple (which consists of two compatible complete cotorsion…
It is known since 1973 that Lawvere's notion of (Cauchy-)complete enriched category is meaningful for metric spaces: it captures exactly Cauchy-complete metric spaces. In this paper we introduce the corresponding notion of Lawvere…
Wigner found unreasonable the "effectiveness of mathematics in the natural sciences". But if the mathematics we use to describe nature is simply a coded expression of our experience then its effectiveness is quite reasonable. Its…
Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free…
We consider the long-standing question of whether every regular LB-space is complete. This problem has been open since the 1950s and originates in Grothendieck's early work in functional analysis. Rather than seeking a direct proof or…
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…
We consider various notions of completeness in symplectic topology and ask two related questions. Does a complete open symplectic manifold remain complete after excising a subset? Can two sets be made arbitrarily far apart by adjusting the…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…
This paper exposes the language of geometric contexts and elementary schemes, which is a functorial formalism to study categories of geometric objects such as schemes, topological manifolds, differential manifolds, analytic manifolds, etc.…
Recently, Abbadini and Guffanti gave an algebraic proof of Herbrand's theorem using a completion for Lawvere doctrines that freely adds existential and universal quantifiers. A more direct argument can be given by only completing with…
This paper has two goals. The first goal is to show how an extension of second-order logic is a natural framework to formalize portions of Aristotle's \emph{Topics} and to bring to the foreground the logical, linguistic and philosophical…
A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic theories purely in terms of the properties of…
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML. We…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
The focus of this article is on metric completions of triangulated categories arising in the representation theory of hereditary finite dimensional algebras and commutative rings. We explicitly describe all completions of bounded derived…