Guessing models and generalized Laver diamond

DOI10.1016/J.APAL.2011.12.015MaRDI QIDQ450960zbMATH OpenOpenAlexFDO

Authors Matteo Viale

Publication date 26 September 2012

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.2212

zbMATH Keywords

large cardinalsforcing axiomselementary embeddingsguessing modelinaccessibilityLaver diamond

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Other set-theoretic hypotheses and axioms (03E65)

Abstract: We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from supercompactness to rank-to-rank embeddings. The majority of these large cardinals properties can be defined in terms of suitable elementary embeddings jcolon V_gamma o V_lambda. One key observation is that such embeddings are uniquely determined by the image structures j [ V_gamma ]prec V_lambda. These structures will be the prototypes guessing models. We shall show, using guessing models M, how to prove for the ordinal kappa_M=j_M (crit(j_M)) (where pi_M is the transitive collapse of M and j_M is its inverse) many of the combinatorial properties that we can prove for the cardinal j(crit(j)) using the structure j[V_gamma]prec V_{j(gamma)}. kappa_M will always be a regular cardinal, but consistently can be a successor. Guessing models M with kappa_M=aleph_2 exist assuming the proper forcing axiom PFA. By means of these models we shall introduce a new structural property of models of PFA: the existence of a "Laver function" f : aleph_2 o H_{aleph_2} sharing the same features of the usual Laver functions f :kappa o H_kappa provided by a supercompact cardinal kappa. Further applications of our analysis will be proofs of the singular cardinal hypothesis and of the failure of the square principle assuming the existence of guessing models. In particular the failure of square shows that the existence of guessing models is a very strong assumption in terms of large cardinal strength.

Recommendations

• JOINT DIAMONDS AND LAVER DIAMONDS
• Prevalence of generic Laver diamond
• Guessing models imply the singular cardinal hypothesis
• Guessing and non-guessing of canonical functions
• Indestructible guessing models and the continuum

Cites work

• scientific article; zbMATH DE number 2121504 (Why is no real title available?)
• A family of covering properties
• A general Mitchell style iteration
• A new proof of Kunen’s inconsistency
• Combinatorial Characterization of Supercompact Cardinals
• Handbook of Set Theory
• INTERNAL APPROACHABILITY AND REFLECTION
• Internally club and approachable for larger structures
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• On the consistency strength of the proper forcing axiom
• On the role of supercompact and extendible cardinals in logic
• Precipitous towers of normal filters
• Set Theory
• The axiom of determinacy, forcing axioms, and the nonstationary ideal
• The combinatorial essence of supercompactness
• The higher infinite. Large cardinals in set theory from their beginnings.

Cited in

(26)

• On disjoint stationary sequences
• A note on highly connected and well-connected Ramsey theory
• Guessing models and the approachability ideal
• ITP, ISP, and SCH
• On the universality of the nonstationary ideal
• Covering properties and square principles
• Guessing and non-guessing of canonical functions
• Indestructible guessing models and the continuum
• On the consistency strength of the proper forcing axiom
• FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION
• Strong tree properties for small cardinals
• Narrow systems revisited
• Martin's maximum and tower forcing
• Martin's maximum revisited
• Maximum deconstructibility in module categories
• PFA and ideals on \(\omega_{2}\) whose associated forcings are proper
• SPECIALISING TREES WITH SMALL APPROXIMATIONS I
• The super tree property at the successor of a singular
• Strong tree properties, Kurepa trees, and guessing models
• Namba forcing, weak approximation, and guessing
• Salce's problem on cotorsion pairs is undecidable
• Strong tree properties for two successive cardinals
• Small embedding characterizations for large cardinals
• Guessing models imply the singular cardinal hypothesis
• Prevalence of generic Laver diamond
• Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)

This page was built for publication: Guessing models and generalized Laver diamond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450960)