SearcharxivSearch

arXiv · 2405.09674

$\Sigma_n$-correct Forcing Axioms

Abstract

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$ property $\phi$ which is provably preserved by all further forcing in $\Gamma$, then $\dot{a}$ reflects to some small name such that there is already in $V$ a filter which interprets that small name so that $\phi$ holds. $\Sigma_1$-correct forcing axioms turn out to be equivalent to classical forcing axioms, while $\Sigma_2$-correct forcing axioms for $\Sigma_2$-definable forcing classes are consistent relative to a supercompact cardinal (and in fact hold in the standard model of a classical forcing axiom constructed as an extension of a model with a supercompact), $\Sigma_3$-correct forcing axioms are consistent relative to an extendible cardinal, and more generally $\Sigma_n$-correct forcing axioms are consistent relative to a hierarchy of large cardinals generalizing supercompactness and extendibility whose supremum is the first-order version of Vopenka's Principle. By analogy to classical forcing axioms, there is also a hierarchy of $\Sigma_n$-correct bounded forcing axioms which are consistent relative to appropriate large cardinals. At the two lowest levels of this hierarchy, outright equiconsistency results are easy to obtain. Beyond these consistency results, I also study when $\Sigma_n$-correct forcing axioms are preserved by forcing, how they relate to previously studied axioms and to each other, and some of their mathematical implications.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Goodman. 2024-05-15. $\Sigma_n$-correct Forcing Axioms. https://arxiv.org/abs/2405.09674

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