SearcharxivSearch

arXiv · 1409.7925

A C-system defined by a universe category

Abstract

This is a major update of the previous version. The methods of the paper are now fully constructive and the style is "formalization ready" with the emphasis on the possibility of formalization both in type theory and in constructive set theory without the axiom of choice. This is the third paper in a series started in 1406.7413. In it we construct a C-system $CC({\cal C},p)$ starting from a category $\cal C$ together with a morphism $p:\widetilde{U}\rightarrow U$, a choice of pull-back squares based on $p$ for all morphisms to $U$ and a choice of a final object of $\cal C$. Such a quadruple is called a universe category. We then define universe category functors and construct homomorphisms of C-systems $CC({\cal C},p)$ defined by universe category functors. As a corollary of this construction and its properties we show that the C-systems corresponding to different choices of pull-backs and final objects are constructively isomorphic. In the second part of the paper we provide for any C-system CC three constructions of pairs $(({\cal C},p),H)$ where $({\cal C},p)$ is a universe category and $H:CC\rightarrow CC({\cal C},p)$ is an isomorphism. In the third part we define, using the constructions of the previous parts, for any category $C$ with a final object and fiber products a C-system $CC(C)$ and an equivalence $(J^*,J_*):C \rightarrow CC$.

Explore related subjects

Keep this discovery

BibTeXRIS

Vladimir Voevodsky. 2014-09-28. A C-system defined by a universe category. https://arxiv.org/abs/1409.7925

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