Guessing models, trees and cardinal arithmetic
From MaRDI portal
No records found.
Cites work
- A family of covering properties
- A forcing axiom for a non-special Aronszajn tree
- A general Mitchell style iteration
- Combinatorial Characterization of Supercompact Cardinals
- Covering properties and square principles
- Extensions with the approximation and cover properties have no new large cardinals
- Fragility and indestructibility of the tree property
- Guessing models and generalized Laver diamond
- Guessing models imply the singular cardinal hypothesis
- scientific article; zbMATH DE number 3885892 (Why is no real title available?)
- scientific article; zbMATH DE number 3531389 (Why is no real title available?)
- scientific article; zbMATH DE number 734993 (Why is no real title available?)
- scientific article; zbMATH DE number 1113072 (Why is no real title available?)
- scientific article; zbMATH DE number 1137961 (Why is no real title available?)
- Indestructible guessing models and the continuum
- Katětov's problem
- Meeting numbers and pseudopowers
- On strong compactness and supercompactness
- On the consistency strength of the proper forcing axiom
- Quotients of strongly proper forcings and guessing models
- Random Reals and Souslin Trees
- Set Theory
- Some combinatorial problems concerning uncountable cardinals
- Some consequences of MA + non wKH
- Some consequences of reflection on the approachability ideal
- Strong tree properties, Kurepa trees, and guessing models
- The axiom of determinacy, forcing axioms, and the nonstationary ideal
- The combinatorial essence of supercompactness
- The proper forcing axiom and the singular cardinal hypothesis
- Towers and clubs
- Universal graphs at \(\aleph_{\omega_1 + 1}\)
This page was built for publication: Guessing models, trees and cardinal arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286171)
