SearcharxivSearch

arXiv · 1309.0389

Godel's Completeness Theorem and Deligne's Theorem

Abstract

These notes were written for a presentation given at the university Paris VII in January 2012. The goal was to explain a proof of a famous theorem by P. Deligne about coherent topoi (coherent topoi have enough points) and to show how this theorem is equivalent to Gödel's completeness theorem for first order logic. Because it was not possible to cover everything in only three hours, the focus was on Barr's and Deligne's theorems. This explains why the corresponding sections have been given more attention. Section 1 and the Appendix were added in an attempt to make this document self-contained and understandable by a reader with a good knowledge of topos theory. A coherent topos is a topos which is equivalent to a Grothendieck topos that admits a site $(C,J)$ such that $C$ has finite limits and there exists a base of $J$ with finite covering families. In order to prove that any coherent topos has enough points, it is enough to show that for any coherent topos $\mathcal{E}$ there is a surjective geometric morphism from a topos with enough points to $\mathcal{E}$. As sheaf topoi over topological spaces have enough points, any surjective geometric morphism from some $Sh(X)$, with $X$ a topological space, to $\mathcal{E}$ is sufficient. These are provided by Barr's theorem. This is the approach that will be taken here (following MacLane and Moerdijk, Sheaves in Geometry and Logic).

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Frot. 2013-09-02. Godel's Completeness Theorem and Deligne's Theorem. https://arxiv.org/abs/1309.0389

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

KEEP EXPLORING

Related papers

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

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

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