Iterated forcing and changing cofinalities
From MaRDI portal
Publication:1159635
DOI10.1007/BF02761815zbMath0476.03055MaRDI QIDQ1159635
Publication date: 1981
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
measurable cardinalsinaccessible cardinalregular cardinalnormal precipitous idealchain conditionsclosed setPrikry forcingproper forcinggeneralizationspseudo-completenessNamba forcingrevised countable support iterationcountable-support iterationGalvin filtersnormal precipitous filternormal ultrafilteromega sequencesemi- propernesssuper compact cardinals
Consistency and independence results (03E35) Large cardinals (03E55) Other aspects of forcing and Boolean-valued models (03E40)
Related Items
Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees ⋮ Gelfand numbers of operators with values in a Hilbert space ⋮ Distributive ideals and partition relations ⋮ ASYMMETRIC CUT AND CHOOSE GAMES ⋮ Interpolation and integral norms of hyperbolic polynomials ⋮ On volume distribution in 2-convex bodies ⋮ Semiproper forcing axiom implies Martin maximum but not PFA+ ⋮ On Gaussian marginals of uniformly convex bodies ⋮ New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\) ⋮ Approximation of zonoids by zonotopes ⋮ The nonstationary ideal on \(\aleph _ 2\) ⋮ Constructions of many complicated uncountable structures and Boolean algebras ⋮ On the \({\mathbb{I}}\)-condition ⋮ Distances between normed spaces, their subspaces and quotient spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Precipitous ideals and \(\sum^1_4\) sets
- Free limits of forcing and more on Aronszajn trees
- Proper forcing
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Iterated Cohen extensions and Souslin's problem
- Precipitous ideals
- Independence results
- One hundred and two problems in mathematical logic
- A new class of order types
- Adding a closed unbounded set
- An ideal game
- Ideals over uncountable sets: application of almost disjoint functions and generic ultrapowers