SearcharxivSearch

arXiv · 2101.01698

Broad Infinity and Generation Principles

Abstract

We introduce Broad Infinity, a new set-theoretic axiom scheme based on the slogan "Every time we construct a new element, we gain a new arity." It says that three-dimensional trees whose growth is controlled by a specified class function form a set. Such trees are called "broad numbers". Assuming AC (the axiom of choice), or at least the weak version known as WISC (Weakly Initial Set of Covers), we show that Broad Infinity is equivalent to Mahlo's principle, which says that the class of all regular limit ordinals is stationary. Assuming AC or WISC, Broad Infinity also yields a convenient principle for generating a subset of a class using a "rubric" (family of rules). This directly gives the existence of Grothendieck universes, without requiring a detour via ordinals. In the absence of choice, Broad Infinity implies that the derivations of elements from a rubric form a set. This yields the existence of Tarski-style universes. Additionally, we reveal a pattern of resemblance between "Wide" principles, that are provable in ZFC, and "Broad" principles, that go beyond ZFC. Note: this paper uses a base theory that is weaker than ZF but includes classical first-order logic and Replacement.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Blain Levy. 2021-01-05. Broad Infinity and Generation Principles. https://doi.org/10.1215/00294527-2024-0029

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