Related papers: Quotients, pure existential completions and arithm…
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…
In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…
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…
G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…
Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…
We characterize groups with Guoliang Yu's property A (i.e., exact groups) by the existence of a family of uniformly bounded representations which approximate the trivial representation.
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
Q-systems are unitary versions of Frobenius algebra objects which appeared in the theory of subfactors. In recent joint work with R. Hern\'andez Palomares and C. Jones, the authors defined a notion of Q-system completion for C*/W*…
Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…
This note concerns the category $\Box$ of cartesian cubes with connections, equivalently the full subcategory of posets on objects $[1]^n$ with $n \geq 0$. We show that the idempotent completion of $\Box$ consists of finite complete posets.…
We study linear $\alpha_p$-actions on affine spaces and the associated quotient singularities, using explicit stacky resolutions. We describe when the quotient singularities are log canonical, canonical or terminal, and we compute their…
This paper is part of a project that is based on the notion of dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In previous work, we investigated the expressive and computational power of…
We prove that some subquotient categories of exact categories are abelian. This generalizes a result by Koenig-Zhu in the case of (algebraic) triangulated categories. As a particular case, if an exact category B with enough projectives and…