English
Related papers

Related papers: Existential completions and Herbrand's theorem

200 papers

A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…

Category Theory · Mathematics 2009-09-29 Brian J. Day

We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…

Logic in Computer Science · Computer Science 2017-06-28 Carlos Caleiro , Sérgio Marcelino , João Marcos

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…

Logic in Computer Science · Computer Science 2007-05-23 J. Adamek , S. Milius , J. Velebil

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz…

Logic · Mathematics 2021-07-01 R. Jansana , T. Moraschini

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Category Theory · Mathematics 2022-11-04 Robin Cockett , Priyaa Varshinee Srinivasan

This paper supplies additions to our paper in Linear Algebra Appl. 510 (2016) 395--420 on integral spans of tight frames in Euclidean spaces. In that previous paper, we considered the case of an equiangular tight frame (ETF), proving that…

Number Theory · Mathematics 2018-10-15 Albrecht Boettcher , Lenny Fukshansky

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances…

Logic in Computer Science · Computer Science 2013-08-05 Stefan Hetzl , Daniel Weller

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,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…

Functional Analysis · Mathematics 2014-10-23 Gerard Buskes , Chris Schwanke

General results on multiplicative lattices found recently by Facchini, Finocchiaro and Janelidze have been studied in the particular case of groups by Facchini, de Giovanni and Trombetti. In this paper we prove that these results hold not…

Group Theory · Mathematics 2022-04-26 Alberto Facchini

We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…

Logic · Mathematics 2013-04-05 Tarek Sayed Ahmed

In this paper, we will show how the Caratheodory Extension process is intimately related to the metric completion process. In particular, it will be shown how one is able to construct a lattice on the completion and to obtain an isomorphism…

Logic · Mathematics 2009-07-06 Jun Tanaka , Peter McLoughlin

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

Logic in Computer Science · Computer Science 2025-10-31 Michael Benedikt , Chia-Hsuan Lu , Tony Tan

The elementary quotient completion of an elementary doctrine in the sense of Lawvere was introduced in previous work by the first and third authors. It generalises the exact completion of a category with finite products and weak equalisers.…

Logic · Mathematics 2024-10-10 Maria Emilia Maietti , Fabio Pasquali , Giuseppe Rosolini

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…

Rings and Algebras · Mathematics 2013-10-01 George Grätzer

The theory of integrals is used to analyse the structure of Hopf algebroids, introduced in math.QA/0302325. We prove that the total algebra of the Hopf algebroid is a separable extension of the base algebra if and only if it is a…

Quantum Algebra · Mathematics 2008-12-09 Gabriella Böhm

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Rings and Algebras · Mathematics 2021-03-24 Ivan Chajda , Helmut Länger

As an instance of a linear action of a Hopf algebra on a free associative algebra, we consider finite group gradings of a free algebra induced by gradings on the space spanned by the free generators. The homogeneous component corresponding…

Rings and Algebras · Mathematics 2008-11-12 Vitor O. Ferreira , Lucia S. I. Murakami

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the…

Combinatorics · Mathematics 2026-02-23 Florent Hivert , Vincent Pilaud , Ludovic Schwob

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang