Forcing with copies of the Rado and Henson graphs

DOI10.1016/j.apal.2023.103286MaRDI QIDQ6156418

Stevo Todorčević, Osvaldo Guzmán González

Publication date: 13 June 2023

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

zbMATH Keywords

random graphSacks forcingHenson graphposet of copiesultrahomogenous graphs

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Models with special properties (saturated, rigid, etc.) (03C50) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The poset of all copies of the random graph has the 2-localization property
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Forcing by non-scattered sets
• Maximal chains of isomorphic subgraphs of the Rado graph
• Coloring subgraphs of the Rado graph
• Different similarities
• Henson graphs and Urysohn-Henson graphs as Cayley graphs
• Forcing with quotients
• Sacks forcing and the total failure of Martin's axiom
• Coloring of universal graphs
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• The indivisibility of the homogeneous \(K_ n\)-free graphs
• Copies of the random graph
• On big Ramsey degrees for binary free amalgamation classes
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Ramsey type properties of ideals
• Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
• Rainbow Ramsey simple structures
• Big Ramsey degrees of 3-uniform hypergraphs are finite
• Notes on Forcing Axioms
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• Mapping a set of reals onto the reals
• Structural Ramsey theory of metric spaces and topological dynamics of isometry groups
• Preserving P-points in definable forcing
• Products of Infinitely Many Perfect Trees
• Iterated perfect-set forcing
• The Random Graph and Automorphisms of the Rational World
• Descriptive set theory and definable forcing
• Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
• A parametrized diamond principle and union ultrafilters
• Selective ultrafilters on FIN
• CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
• Playful Boolean Algebras
• Set Theory
• Overgroups of the Automorphism Group of the Rado Graph
• Topological Ramsey Spaces Dense in Forcings
• Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
• Indivisible sets and well‐founded orientations of the Rado graph
• The Ramsey theory of the universal homogeneous triangle-free graph
• Forcing with copies of countable ordinals
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Ramsey Theory for Discrete Structures
• The random graph
• The Ramsey theory of Henson graphs
• Multiple Forcing
• A family of countable homogeneous graphs

This page was built for publication: Forcing with copies of the Rado and Henson graphs