Random graphs in the monadic theory of order

DOI10.1007/S001530050129zbMath0935.03057arXivmath/9701219OpenAlexW2156066381MaRDI QIDQ1306794

Shmuel Lifsches, Saharon Shelah

Publication date: 2 May 2000

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

Full work available at URL: https://arxiv.org/abs/math/9701219

zbMATH Keywords

forcinginterpretabilityconsistent with ZFCmonadic theory of the real linemonadic theory of linear orderstheory of random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Consistency and independence results (03E35)

Related Items (2)

The full binary tree cannot be interpreted in a chain ⋮ Lower bounds on coloring numbers from hardness hypotheses in pcf theory

This page was built for publication: Random graphs in the monadic theory of order