Skip to main content
Conference Proceedings

On failure of 0-1 laws

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9300 293-296
DOI: 10.1007/978-3-319-23534-9_18
2Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let α ∈ (0, 1)ℝ be irrational and Gn = Gn,1/nα be the random graph with edge probability 1/nα; we know that it satisfies the 0-1 law for first order logic. We deal with the failure of the 0-1 law for stronger logics: (Formula presented.), k a large enough natural number and the inductive logic.

Author supplied keywords

Cite

CITATION STYLE

APA

Shelah, S. (2015). On failure of 0-1 laws. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9300, pp. 293–296). Springer Verlag. https://doi.org/10.1007/978-3-319-23534-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free