Related papers: Existential completions and Herbrand's theorem
In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove their own completeness. We prove a completeness theorem for theories equipped with two provability predicates $\Box$ and $\triangle$ that…
We extend Faltings's "almost purity theorem" on finite etale extensions of perfectoid algebras (as generalized by Scholze and Kedlaya-Liu) to the ramified case, without restriction on the discriminant. The key point is a perfectoid version…
Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means of finite Hilbert calculi. On the side of negative…
The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan…
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
The paper investigates from a proof-theoretic perspective various non-contractive logical systems circumventing logical and semantic paradoxes. Until recently, such systems only displayed additive quantifiers (Gri\v{s}in, Cantini). Systems…
We provide a new description of Joyal's arithmetic universes through a characterization of the exact and regular completions of pure existential completions. We show that the regular and exact completions of the pure existential completion…
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Hyland's effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates Church's Thesis. It also contains a boolean full sub-quasitopos of "assemblies" where…
Let H be a Hilbert space and let F be the family of all countable subsets of an orthonormal basis of H. We show that if F is infinite then F is equipollent with every linear basis of the vector space H. In doing so we also present a short…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
Many arguments in the Theory of Rings and Modules are, on close inspection, purely Lattice theoretic arguments. Calagareanu} has a long repertoire of such results in his book. The Hopkins-Levitzki Theorem is interesting from this point of…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
In the category of Hom-Leibniz algebras we introduce the notion of representation as adequate coefficients to construct the chain complex to compute the Leibniz homology of Hom-Leibniz algebras. We study universal central extensions of…