SearcharxivSearch

arXiv · 2405.16704

Non-Normal Magidor-Radin Types of Forcings

Abstract

We develop the non-normal variations of two classical Prikry-type forcings; namely, Magidor and Radin forcings. We generalize the fact that the non-normal Prikry forcing is a projection of the extender-based to a coordinate of the extender to our forcing and the Radin/Magidor-Radin-extender-based forcing from \cite{CarmiMagidorRadin,CarmiRadin}. Then, we show that both the non-normal variation of Magidor and Radin forcings can add a Cohen generic function to every limit point of cofinality $\omega$ of the generic club. Second, we show that this phenomenon is limited to the cases where the forcings are not designed to change the cofinality of a measurable $\kappa$ to $\omega_1$. Specifically, in the above-mentioned circumstances these forcings do not project onto any $\kappa$-distributive forcing. We use that to conclude that the extender-based Radin/Magidor-Radin forcing does not add fresh subsets to $\kappa$ as well. In the second part of the paper we focus on the natural non-normal variation of Gitik's forcing from \cite[\S3]{GitikNonStationary}. Our main result shows that this poset can be employed to change the cofinality of a measurable cardinal $\kappa$ to $\omega_1$ while introducing a Cohen subset of $\kappa$.

Explore related subjects

Keep this discovery

BibTeXRIS

Tom Benhamou, Alejandro Poveda. 2024-05-26. Non-Normal Magidor-Radin Types of Forcings. https://arxiv.org/abs/2405.16704

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