SearcharxivSearch

arXiv · 1709.01967

Infinitary generalizations of Deligne's completeness theorem

Abstract

Given a regular cardinal $κ$ such that $κ^{<κ}=κ$, we study a class of toposes with enough points, the $κ$-separable toposes. These are equivalent to sheaf toposes over a site with $κ$-small limits that has at most $κ$ many objects and morphisms, the (basis for the) topology being generated by at most $κ$ many covering families, and that satisfy a further exactness property $T$. We prove that these toposes have enough $κ$-points, that is, points whose inverse image preserve all $κ$-small limits. This generalizes the separable toposes of Makkai and Reyes, that are a particular case when $κ=ω$, when property $T$ is trivially satisfied. This result is essentially a completeness theorem for a certain infinitary logic that we call $κ$-geometric, where conjunctions of less than $κ$ formulas and existential quantification on less than $κ$ many variables is allowed. We prove that $κ$-geometric theories have a $κ$-classifying topos having property $T$, the universal property being that models of the theory in a Grothendieck topos with property $T$ correspond to $κ$-geometric morphisms (geometric morphisms the inverse image of which preserves all $κ$-small limits) into that topos. Moreover, we prove that $κ$-separable toposes occur as the $κ$-classifying toposes of $κ$-geometric theories of at most $κ$ many axioms in canonical form, and that every such $κ$-classifying topos is $κ$-separable. Finally, we consider the case when $κ$ is weakly compact and study the $κ$-classifying topos of a $κ$-coherent theory (with at most $κ$ many axioms), that is, a theory where only disjunction of less than $κ$ formulas are allowed, obtaining a version of Deligne's theorem for $κ$-coherent toposes.

Explore related subjects

Keep this discovery

BibTeXRIS

Christian Espíndola. 2017-09-06. Infinitary generalizations of Deligne's completeness theorem. https://arxiv.org/abs/1709.01967

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