Forcing with copies of the Rado and Henson graphs
From MaRDI portal
Publication:6156418
DOI10.1016/J.APAL.2023.103286MaRDI QIDQ6156418FDOQ6156418
Authors: Osvaldo Guzmán, Stevo Todorčević 
Publication date: 13 June 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Models with special properties (saturated, rigid, etc.) (03C50) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Structural Ramsey theory of metric spaces and topological dynamics of isometry groups
- Set Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
- Forcing idealized
- Forcing with quotients
- The poset of all copies of the random graph has the 2-localization property
- From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
- Forcing by non-scattered sets
- Title not available (Why is that?)
- Forcing with copies of countable ordinals
- The random graph
- Different similarities
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Ramsey type properties of ideals
- Set theory.
- Combinatorics of filters and ideals
- Ramsey theory for discrete structures
- Title not available (Why is that?)
- Iterated perfect-set forcing
- Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
- Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
- Maximal chains of isomorphic subgraphs of the Rado graph
- A family of countable homogeneous graphs
- Descriptive set theory and definable forcing
- A parametrized diamond principle and union ultrafilters
- Maximal antichains of isomorphic subgraphs of the Rado graph
- Multiple Forcing
- The Ramsey theory of Henson graphs
- Henson graphs and Urysohn-Henson graphs as Cayley graphs
- Playful Boolean Algebras
- The indivisibility of the homogeneous \(K_ n\)-free graphs
- Products of Infinitely Many Perfect Trees
- Preserving P-points in definable forcing
- Notes on forcing axioms
- Coloring subgraphs of the Rado graph
- Title not available (Why is that?)
- Sacks forcing and the total failure of Martin's axiom
- Copies of the random graph
- CONTINUOUS RAMSEY THEORY ON POLISH SPACES AND COVERING THE PLANE BY FUNCTIONS
- Big Ramsey degrees of 3-uniform hypergraphs are finite
- Coloring of universal graphs
- Posets of isomorphic substructures of relational structures
- Rainbow Ramsey simple structures
- Mapping a set of reals onto the reals
- On symmetric indivisibility of countable structures
- The Random Graph and Automorphisms of the Rational World
- Notes on endomorphisms of Henson graphs and their complements.
- The Ramsey theory of the universal homogeneous triangle-free graph
- Selective ultrafilters on FIN
- Topological Ramsey Spaces Dense in Forcings
- Ramsey theory on infinite structures and the method of strong coding trees
- On big Ramsey degrees for binary free amalgamation classes
- Overgroups of the automorphism group of the Rado graph
- Title not available (Why is that?)
- Forcing axioms and the continuum problem
- Indivisible sets and well-founded orientations of the Rado graph
Cited In (2)
This page was built for publication: Forcing with copies of the Rado and Henson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156418)
