Random graphs in the monadic theory of order

Shmuel Lifsches*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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).

Original languageEnglish
Pages (from-to)273-312
Number of pages40
JournalArchive for Mathematical Logic
Volume38
Issue number4-5
DOIs
StatePublished - May 1999

Fingerprint

Dive into the research topics of 'Random graphs in the monadic theory of order'. Together they form a unique fingerprint.

Cite this