English
Related papers

Related papers: Quotients, pure existential completions and arithm…

200 papers

The notion of $n$-exangulated categories was introduced by Herschend-Liu-Nakaoka, which is a simultaneous generalization of $n$-exact categories in the sense of Jasso and $(n+2)$-angulated categories in the sense of Geiss-Kelier-Oppermann.…

Representation Theory · Mathematics 2025-10-09 Yutong Zhou

This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.

Logic · Mathematics 2007-10-17 Benno van den Berg , Ieke Moerdijk

Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a…

Logic in Computer Science · Computer Science 2020-03-02 Asta Halkjær From , Alexander Birch Jensen , Anders Schlichtkrull , Jørgen Villadsen

We propose a geometric setting of the axiomatic mathematical formalism of quantum theory. Guided by the idea that understanding the mathematical structures of these axioms is of similar importance as was historically the process of…

Mathematical Physics · Physics 2017-11-27 Wolfgang Bertram

This paper is the first of several parts introducing a new powerful algebra: the algebra of the pseudo-observables. This is a C*-algebra whose set is formed by formal expressions involving observables. The algebra is constructed by applying…

Quantum Physics · Physics 2025-08-21 Edoardo Piparo

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…

Logic in Computer Science · Computer Science 2017-01-11 George Metcalfe , Leonardo Cabrer

We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…

Logic · Mathematics 2019-01-01 Christian Espíndola

The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Aristotelis Panagiotopoulos , George Sparling , Marios Christodoulou

We generalize the strong comparison theorem of Franjou, Friedlander, Scorichenko and Suslin to the setting of Fp-linear additive categories. Our results have a strong impact in terms of explicit computations of functor homology, and they…

Algebraic Topology · Mathematics 2024-07-16 Aurélien Djament , Antoine Touzé

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…

Logic · Mathematics 2009-10-13 Marco B. Caminati

For an exact category we provide two constructions of an ambient category in which the initial category is resolving: In the derived category and in the Gabriel--Quillen embedding. For the first construction we describe a pre-aisle and its…

Representation Theory · Mathematics 2026-03-16 Marianne Lawson , Janina C. Letz , Julia Sauter

Proto-exact and parabelian categories serve as non-additive analogues of exact and quasi-abelian categories, respectively. They give rise to algebraic K-theory and Hall algebras similarly to the additive setting. We show that every…

Representation Theory · Mathematics 2025-03-11 Sergey Mozgovoy

It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…

Commutative Algebra · Mathematics 2021-12-14 Pavlo Dzikovskyi

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…

Logic in Computer Science · Computer Science 2017-07-19 Arne Meier , Thomas Schneider

We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…

Logic · Mathematics 2016-03-30 Jamshid Derakhshan , Angus Macintyre

A rational number can be naturally presented by an arithmetic computation (AC): a sequence of elementary arithmetic operations starting from a fixed constant, say 1. The asymptotic complexity issues of such a representation are studied e.g.…

Computational Complexity · Computer Science 2007-05-23 Sergey P. Tarasov , Mikhail N. Vyalyi

In this paper we redevelop the foundations of the category theory of quasi-categories (also called infinity-categories) using 2-category theory. We show that Joyal's strict 2-category of quasi-categories admits certain weak 2-limits, among…

Category Theory · Mathematics 2015-06-18 Emily Riehl , Dominic Verity

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

Classical Analysis and ODEs · Mathematics 2015-10-27 Kirill A. Kopotun

An order ideal is a finite poset X of (monic) monomials such that, whenever M is in X and N divides M, then N is in X. If all, say t, maximal monomials of X have the same degree, then X is pure (of type t). A pure O-sequence is the vector,…

Combinatorics · Mathematics 2012-02-29 M. Boij , J. Migliore , R. Miro'-Roig , U. Nagel , F. Zanello