English
Related papers

Related papers: The Geometric Completion of a Doctrine

200 papers

The literature dealing with G\"{o}del's legacy is largely preoccupied with challenging his philosophical views, regarding them as outdated. We believe that such an approach prevents us from seeing G\"{o}del's views in the right light and…

History and Overview · Mathematics 2024-06-12 Jovana Kostić , Slobodan Vujošević

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…

Category Theory · Mathematics 2012-06-04 Maria Emilia Maietti , Giuseppe Rosolini

We use a generic notion of flatness in the enriched context to define various completions of metric spaces -- enrichments over [0,\infty] -- and preorders -- enrichments over 2. We characterize the weights of colimits commuting in…

Category Theory · Mathematics 2007-05-23 Vincent Schmitt

Multisymplectic geometry is an adequate formalism to geometrically describe first order classical field theories. The De Donder-Weyl equations are treated in the framework of multisymplectic geometry, solutions are identified as integral…

Mathematical Physics · Physics 2009-11-07 C. Paufler , H. Roemer

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…

Category Theory · Mathematics 2013-07-12 Richard Garner

We provide a co-free construction which adds elementary structure to a primary doctrine. We show that the construction preserves comprehensions and all the logical operations which are in the starting doctrine, in the sense that it maps a…

Logic · Mathematics 2014-01-31 Fabio Pasquali

We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a…

Logic in Computer Science · Computer Science 2023-11-27 Patrick Cousot

Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…

Logic in Computer Science · Computer Science 2025-08-19 Logan Nye

We abstract and generalize homotopical monadicity statements, placing in a single conceptual framework a range of old and recent recognition and characterization principles in iterated loop space theory in classical, equivariant, and…

Algebraic Topology · Mathematics 2024-02-07 Hana Jia Kong , J. Peter May , Foling Zou

Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…

Logic in Computer Science · Computer Science 2019-05-16 Simon Marynissen

We call a finitely complete category algebraically coherent when the change-of-base functors of its fibration of points are coherent, which means that they preserve finite limits and jointly strongly epimorphic pairs of arrows. We give…

Category Theory · Mathematics 2015-12-10 Alan S. Cigoli , James R. A. Gray , Tim Van der Linden

Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…

Artificial Intelligence · Computer Science 2022-08-08 Simon Marynissen , Bart Bogaerts

Logic has proved essential for formally modeling software based systems. Such formal descriptions, frequently called specifications, have served not only as requirements documentation and formalisation, but also for providing the…

Logic in Computer Science · Computer Science 2021-07-20 Carlos G. Lopez Pombo , Thomas S. E. Maibaum

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

For a (semi-)model category M, we define a notion of a ''homotopy'' Grothendieck topology on M, as well as its associated model category of stacks. We use this to define a notion of geometric stack over a symmetric monoidal base model…

Algebraic Geometry · Mathematics 2007-05-23 Bertrand Toen , Gabriele Vezzosi

We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…

Logic · Mathematics 2024-12-19 Yasha Savelyev

In category theory, logic and geometry cooperate with each other producing what is known under the name Synthetic Differential Geometry (SDG). The main difference between SDG and standard differential geometry is that the intuitionistic…

Differential Geometry · Mathematics 2016-05-12 Michael Heller , Jerzy Król

We define a theory of etale motives over a noetherian scheme. This provides a system of categories of complexes of motivic sheaves with integral coefficients which is closed under the six operations of Grothendieck. The rational part of…

Algebraic Geometry · Mathematics 2019-02-20 Denis-Charles Cisinski , Frédéric Déglise

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin