Logical laws for short existential monadic second-order sentences about graphs

Journal of Mathematical Logic 20 (2):2050007 (2019)
  Copy   BIBTEX

Abstract

In 2001, Le Bars proved that there exists an existential monadic second-order sentence such that the probability that it is true on [Formula: see text] does not converge and conjectured that, for EMSO sentences with two first-order variables, the zero–one law holds. In this paper, we prove that the conjecture fails for [Formula: see text], and give new examples of sentences with fewer variables without convergence.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2019-09-26

Downloads
16 (#935,433)

6 months
5 (#710,311)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Handbook of Mathematical Logic.Jon Barwise - 1979 - British Journal for the Philosophy of Science 30 (3):306-309.
Monadic second-order properties of very sparse random graphs.L. B. Ostrovsky & M. E. Zhukovskii - 2017 - Annals of Pure and Applied Logic 168 (11):2087-2101.
Almost sure theories.James F. Lynch - 1980 - Annals of Mathematical Logic 18 (2):91.

Add more references