SearcharxivSearch

arXiv · 2506.21653

Existence Theorem for Cumulative Universe Towers and Its Applications

Abstract

This paper builds a cumulative tower of Grothendieck universes that provides a precise size discipline for higher type theory. Starting from an increasing sequence of inaccessible cardinals, we give an inductive-recursive definition of universe codes, their decoding functor, and a rank that controls the growth of each code. For every level of the tower we prove closure under dependent products, dependent sums, identity types, and all finite limits and colimits; the colimit part is obtained with a rank-stable quotient constructor. A universe-lifting operation shows strict cumulativity across levels. Assuming propositional resizing at one level, we construct an explicit left adjoint to the inclusion of minus-one truncated types and show that resizing automatically lifts to every higher level. These ingredients combine in an Existence Theorem stating that, over Zermelo-Fraenkel set theory with the chosen inaccessible cardinals, the tower delivers a sound set-theoretic model of higher type theory. The results supply the size infrastructure required for forthcoming work on Rezk completions and higher topos models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Higuchi Joaquim Reizi. 2025-06-26. Existence Theorem for Cumulative Universe Towers and Its Applications. https://arxiv.org/abs/2506.21653

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