Transactions of the American Mathematical Society · 1982 · 76 citations · 22 references
ComputingComputer ScienceFormal MethodsGeneralizability TheoryUnconscionabilityLarge CardinalsModel TheoryConsistency Strength Of Large CardinalsCountable Chain ConditionMartin’s AxiomSaturationSaturation Of IdealsSaturation Of Nonstationary IdealsSaturation Properties
We consider saturation properties of ideals in models obtained by forcing with countable chain condition partial orderings. As sample results, we mention the following. If <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M left-bracket upper G right-bracket"> <mml:semantics> <mml:mrow> <mml:mi>M</mml:mi> <mml:mo stretchy="false">[</mml:mo> <mml:mi>G</mml:mi> <mml:mo stretchy="false">]</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">M[G]</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is obtained from a model <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M"> <mml:semantics> <mml:mi>M</mml:mi> <mml:annotation encoding="application/x-tex">M</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of GCH via any <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma"> <mml:semantics> <mml:mi> σ </mml:mi> <mml:annotation encoding="application/x-tex">\sigma</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -finite chain condition notion of forcing (e.g. add Cohen reals or random reals) then in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M left-bracket upper G right-bracket"> <mml:semantics> <mml:mrow> <mml:mi>M</mml:mi> <mml:mo stretchy="false">[</mml:mo> <mml:mi>G</mml:mi> <mml:mo stretchy="false">]</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">M[G]</mml:annotation> </mml:semantics> </mml:math> </inline-formula> every countably complete ideal on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega 1"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\omega _1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega 3"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>3</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\omega _3}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -saturated. If " <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma"> <mml:semantics> <mml:mi> σ </mml:mi> <mml:annotation encoding="application/x-tex">\sigma</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -finite chain condition" is weakened to "countable chain condition," then the conclusion no longer holds, but in this case one can conclude that every <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega 2"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\omega _2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -generated countably complete ideal on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega 1"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\omega _1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (e.g. the nonstationary ideal) is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega 3"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>3</mml:mn> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">{\omega _3}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -saturated. Some applications to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper P Subscript omega 1 Baseline left-parenthesis omega 2 right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">P</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>1</mml:mn> </mml:msub> </mml:mrow> </mml:mrow> </mml:msub> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi> ω </mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">{\mathcal {P}_{{\omega _1}}}({\omega _2})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are included and the role played by Martin’s Axiom is discussed. It is also shown that if these weak saturation requirements ar
22
On strong compactness and supercompactness
Telis K. Menas · Annals of Mathematical Logic · 1975 · 174 citations