Equiconsistencies at subcompact cardinals

@article{Neeman2016EquiconsistenciesAS,
  title={Equiconsistencies at subcompact cardinals},
  author={Itay Neeman and John R. Steel},
  journal={Archive for Mathematical Logic},
  year={2016},
  volume={55},
  pages={207-238}
}
  • I. NeemanJ. Steel
  • Published 1 February 2016
  • Mathematics
  • Archive for Mathematical Logic
We present equiconsistency results at the level of subcompact cardinals. Assuming SBHδ, a special case of the Strategic Branches Hypothesis, we prove that if δ is a Woodin cardinal and both □(δ) and □δ fail, then δ is subcompact in a class inner model. If in addition □(δ+) fails, we prove that δ is $${\Pi_1^2}$$Π12 subcompact in a class inner model. These results are optimal, and lead to equiconsistencies. As a corollary we also see that assuming the existence of a Woodin cardinal δ so that SBH… 

Some combinatorial properties of Ultimate L and V

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a

Perfect subtree property for weakly compact cardinals

In this paper we investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this property

The linearity of the Mitchell order

It is shown from an abstract comparison principle (the Ultrapower Axiom) that the Mitchell order is linear on sufficiently strong ultrafilters: normal ultra Filters, Dodd solid ultrafilers, and assuming GCH, generalized normal ultrafilter, to give a conditional answer to whether a supercompact cardinal must carry more than one normal measure of order 0.

Knaster and friends II: The C-sequence number

The C-sequence number is introduced, a new cardinal characteristic which can be seen as a measure of the compactness of a regular uncountable cardinal, and a number of ZFC and independence results are proved about its relationship with large cardinals, stationary reflection, and square principles.

SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS

Abstract We provide a model theoretical and tree property-like characterization of $\lambda $ - $\Pi ^1_1$ -subcompactness and supercompactness. We explore the behavior of these combinatorial

A brief account of recent developments in inner model theory

The goal of this survey paper is to give an overview of recent developments in inner model theory. We discuss several most important questions in the field and relevant work (partially) answering

On $\omega$-Strongly Measurable Cardinals

We prove several consistency results concerning the notion of $\omega$-strongly measurable cardinal in HOD. In particular, we show that is it consistent, relative to a large cardinal hypothesis

Magidor–Malitz reflection

The consistency and consequences of the downward Löwenheim–Skolem–Tarski theorem for extension of the first order logic by the Magidor–Malitz quantifier are investigated and the known upper bound for the consistency of Chang's conjecture at successor of singular cardinals is improved.

Partial strong compactness and squares

In this paper we analyze the connection between some properties of partially strongly compact cardinals: the completion of filters and the compactness of $\mathcal{L}_{\kappa,\kappa}$. We show that

The seed order

We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between

References

SHOWING 1-10 OF 27 REFERENCES

ITERATION TREES

large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large

Local Kc constructions

  • J. Steel
  • Mathematics
    Journal of Symbolic Logic
  • 2007
It is suspect that in fact strong cardinals in V may fail to be strong in V, if is the output of the construction of [2], and one might ask for a construction with output such that iterations on V can be lifted to iteration trees on V.

Inner Models and Large Cardinals

  • R. Jensen
  • Mathematics
    Bulletin of Symbolic Logic
  • 1995
The development of two important themes of modern set theory are sketched, both of which can be regarded as growing out of work of Kurt Godel.

A characterization of (κ + ) in extender models

We prove that, in any fine structural extender model with Jensen's λ-indexing, there is a (κ + )-sequence if and only if there is a pair of stationary subsets of κ + ∩ cof(< κ) without common

A tale of hybrid mice

We develop the basic theory of rigidly layered hod mice below ADR + “Θ is regular”. Woven into this theory is a proof of Mouse Set Conjecture. Once the basic theory is available, it can be applied to

Suitable Extender Models II: beyond ω-Huge

  • W. Woodin
  • Mathematics, Computer Science
    J. Math. Log.
  • 2011
It is shown that there is an analog of ADℝ at the level of ω-huge, more precisely the construction of the minimum model of AD ℝ generalizes to thelevel of Vλ+1, and it is proved that if the axiom holds in V at a proper class of λ then in every suitable extender model, theAxiom holds at a Proper class ofλ.

Square in core models

It is proved that in all Jensen core models, □ k holds iff k is not subcompact, and it is obtained new consistency strength lower bounds for the failure of □k if k is either singular and countably closed, weakly compact, or measurable.

Stacking mice

The main new technical result, which is due to the first author, is a weak covering theorem for the model obtained by stacking mice over Kc∥κ, and it is shown that either of the following hypotheses imply that there is an inner model with a proper class of strong cardinals and a properclass of Woodin cardinals.

A universal extender model without large cardinals in V

Abstract. We construct, assuming that there is no inner model with a Woodin cardinal but without any large cardinal assumption, a model Kc which is iterable for set length iterations, which is