Random graphs in the monadic theory of order
Shmuel Lifsches, Saharon Shelah
Abstract
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the theory of random graphs is not interpretable in the monadic second order theory of short chains (hence, in the monadic theory of the real line).
Create a lesson
Related papers
Friedman--Stanley cofinality without Borel completeness
Ruijun Wang
On Farah ideals and beyond
Adam Kwela
The 1-2-3 Conjecture for Borel Combinatorics
Junhao Chen, Wei Dai
No Borel upper bound for the Fσ equivalence relations
Ruijun Wang
Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective
Olivia Aubone, Eduardo Dueñez, José Iovino
1-Genericity Is Not Weihrauch Reducible to the Finite Intersection Principle
Patrizio Cintioli