SearcharxivSearch

arXiv · 1510.05386

Covering properties and square principles

Abstract

Covering matrices were introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of his work and in subsequent work with Sharon, he isolated two reflection principles, $\mathrm{CP}$ and $\mathrm{S}$, which may hold of covering matrices. In this paper, we continue previous work of the author investigating connections between failures of $\mathrm{CP}$ and $\mathrm{S}$ and variations on Jensen's square principle. We prove that, for a regular cardinal $λ> ω_1$, assuming large cardinals, $\square(λ, 2)$ is consistent with $\mathrm{CP}(λ, θ)$ for all $θ$ with $θ^+ < λ$. We demonstrate how to force nice $θ$-covering matrices for $λ$ which fail to satisfy $\mathrm{CP}$ and $\mathrm{S}$. We investigate normal covering matrices, showing that, for a regular uncountable $κ$, $\square_κ$ implies the existence of a normal $ω$-covering matrix for $κ^+$ but that cardinal arithmetic imposes limits on the existence of a normal $θ$-covering matrix for $κ^+$ when $θ$ is uncountable. We also investigate certain increasing sequences of functions which arise from covering matrices and from PCF-theoretic considerations and show that a stationary reflection hypothesis places limits on the behavior of these sequences.

Explore related subjects

Keep this discovery

BibTeXRIS

Chris Lambie-Hanson. 2016-05-04. Covering properties and square principles. https://arxiv.org/abs/1510.05386

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