Zero-one laws for existential first-order sentences of bounded quantifier depth
From MaRDI portal
Abstract: For any fixed positive integer , let denote the smallest such that the random graph sequence does not satisfy the zero-one law for the set of all existential first order sentences that are of quantifier depth at most . This paper finds upper and lower bounds on , showing that as , we have for some function . We also establish the precise value of when .
Recommendations
- First-order properties of bounded quantifier depth of very sparse random graphs
- When does the zero-one k-law fail?
- On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
- Bounded quantifier depth spectra for random graphs
- Universal zero-one k-law
Cited in
(9)- Logical laws for existential monadic second-order sentences with infinite first-order parts
- Zero-one laws for sentences with \(k\) variables
- Bounded quantifier depth spectra for random graphs
- Zero-one law and definability of linear order
- First-order properties of bounded quantifier depth of very sparse random graphs
- On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
- On first-order sentences without finite models
- Zero-one laws for first-order formulas with a bounded quantifier depth
This page was built for publication: Zero-one laws for existential first-order sentences of bounded quantifier depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034234)