Indivisible sets and well‐founded orientations of the Rado graph

DOI10.1002/malq.201600057OpenAlexW2936497697WikidataQ128062682 ScholiaQ128062682MaRDI QIDQ5108845

Nathanael Leedom Ackerman, William Rea Brian

Publication date: 6 May 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201600057

Mathematics Subject Classification ID

Applications of set theory (03E75) Directed graphs (digraphs), tournaments (05C20) Other combinatorial set theory (03E05) Other classical set theory (including functions, relations, and set algebra) (03E20) Model theory of denumerable and separable structures (03C15)

Related Items

Forcing with copies of the Rado and Henson graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The poset of all copies of the random graph has the 2-localization property
• Set theory. An introduction to independence proofs
• A note on orientations of the infinite random graph
• On interpretations of arithmetic and set theory
• Elementary embeddings and infinitary combinatorics
• Partitions and orientations of the Rado graph
• Tournaments and Orders with the Pigeonhole Property
• EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE
• Universal graphs and universal functions
• Asymmetric graphs