Zero-one laws for first-order formulas with a bounded quantifier depth
From MaRDI portal
Recommendations
- Zero-one laws for existential first-order sentences of bounded quantifier depth
- The zero-one law for the many-sorted logic of the first order predicates
- Zero-one law for an extension of first-order predicate language
- scientific article; zbMATH DE number 4181312
- scientific article; zbMATH DE number 59498
- Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic
- 0-1 laws and decision problems for fragments of second-order logic
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
- Finitistic proofs of 0-1 laws for fragments of second-order logic
- scientific article; zbMATH DE number 65748
Cites work
Cited in
(15)- Program schemes, arrays, Lindström quantifiers and zero-one laws
- On the zero-one 4-law for the Erdős-Rényi random graphs
- On limit points of spectra of the random graph first-order properties
- Bounded quantifier depth spectra for random graphs
- When does the zero-one k-law fail?
- Universal zero-one k-law
- On the zero-one k-law extensions
- Zero-one \(k\)-law
- Short monadic second order sentences about sparse random graphs
- 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
- First-order zero-one law for the uniform model of the random graph
- First-order and monadic properties of highly sparse random graphs
- Random graphs and the parity quantifier
- On the spectra of first-order language properties for random graphs
This page was built for publication: Zero-one laws for first-order formulas with a bounded quantifier depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656220)
