Skip to main content
SpringerLink
Log in

Random graphs in the monadic theory of order

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Mathematics, The Hebrew University, Jerusalem, Israel , , , , , , IL

    Shmuel Lifsches & Saharon Shelah

Authors
  1. Shmuel Lifsches
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saharon Shelah
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 18 July 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lifsches, S., Shelah, S. Random graphs in the monadic theory of order. Arch Math Logic 38, 273–312 (1999). https://doi.org/10.1007/s001530050129

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050129

Keywords

Search

Navigation