On universal graphs without instances of CH

DOI10.1016/0168-0072(84)90042-3MaRDI QIDQ801052zbMATH OpenOpenAlexDBLPWikidataFDO

Authors S. Shelah

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0168-0072(84)90042-3

zbMATH Keywords

cccproper forcingstationary subsetsthinning-outuniversal graph

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35)

Review text

The author proves the striking result that a universal graph on \(\omega_ 1\) may exist under \(2^{\aleph_ 0}=\aleph_ 2\). It is assumed that in the ground model there are \(\aleph_ 2\) stationary subsets of \(\omega_ 1\) with pairwise finite intersetions, this can be achieved by Baumgartner's thinning-out method [\textit{J. E. Baumgartner}, Ann. Math. Logic 9, 401-439 (1976; Zbl 0339.04003)]. First force a graph on \(\omega_ 1\) with finite conditions, then in an iteration up to \(\omega_ 2\) the \(\alpha\) th graph will be pushed into the \(\alpha\) th stationary set. The conditions and the iteration are of finite support with some extra stipulations, similar to Shelah's proof of Baumgartner's theorem on \(\aleph_ 1\)-dense sets [\textit{J. E. Baumgartner}, Ordered sets, Proc. NATO Adv. Study Inst., Banff/Can. 1981, 239-277 (1982; Zbl 0506.04003)]. The main part of the proof is checking ccc of \(P_{\alpha}\) by induction on \(\alpha\), along with proving that some well-behaved conditions are dense. Some generalizations are also proved.

Recommendations

• Universal graphs without instances of CH: Revisited
• Universal graphs without large bipartite graphs assuming GCH
• Universal graphs and functions on \(\omega_1\)
• Negative universality results for graphs
• Universal graphs at \(\aleph_{\omega_1 + 1}\)

Cites work

• Almost-disjoint sets the dense set problem and the partition calculus
• Independence results
• On universal locally finite groups
• Powers of regular cardinals

Cited in

(24)

• Some universal graphs
• Universal elements and the complexity of certain classes of infinite graphs
• On the existence of universal models
• Universal graphs without large bipartite graphs assuming GCH
• Universal matrices and strongly unbounded functions
• Universal graphs and functions on \(\omega_1\)
• Universal graphs at \(\aleph_{\omega_1 + 1}\)
• Banach spaces and groups -- order properties and universal models
• Almost isometric embedding between metric spaces
• Universal functions
• Some positive results in the context of universal models
• Negative universality results for graphs
• Universal graphs at the successor of a singular cardinal
• Small universal families of graphs on \(\aleph_{\omega +1}\)
• Asymptotic quasi-completeness and ZFC
• Universal structures in power ℵ₁
• Nonexistence of universal orders in many cardinals
• On $(1,\omega _{1})$-weakly universal functions
• A rigid Urysohn-like metric space
• Higher dimensional universal functions from lower dimensional ones
• Problems on \(\beta \mathbb{N}\)
• Small universal families for graphs omitting cliques without GCH
• Club guessing and the universal models
• Universal graphs without instances of CH: Revisited

This page was built for publication: On universal graphs without instances of CH

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