Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1402.2600

Scheme representation for first-order logic

Spencer Breiner
View original source ↗Read source document ↗Export metadata ↓

Abstract

Although contemporary model theory has been called "algebraic geometry minus fields", the formal methods of the two fields are radically different. This dissertation aims to shrink that gap by presenting a theory of logical schemes, geometric entities which relate to first-order logical theories in much the same way that algebraic schemes relate to commutative rings. The construction relies on a Grothendieck-style representation theorem which associates every coherent or classical first-order theory with an affine scheme: a topological groupoid (the spectrum of the theory) together with a sheaf of (local) syntactic categories. The groupoid is constructed from the semantics of the theory (models and isomorphisms) and topologized using a Stone-type construction. The sheaf of categories can be regarded as a logical theory varying over the spectrum, and its global sections recover the theory up to semantic equivalence. These affine pieces can be glued together to give more general logical schemes and these are studied using methods from algebraic geometry. The final chapter also presents some connections between schemes and other areas of logic such as model theory, type theory and topos theory.

Explore related subjects

math.LOmath.AGmath.CT

Keep this discovery

BibTeXRIS

Spencer Breiner. 2014-02-11. Scheme representation for first-order logic. https://arxiv.org/abs/1402.2600

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗