The following pages link to Zero-one \(k\)-law (Q418871):
Displayed 22 items.
- On limit points of spectra of the random graph first-order properties (Q265977) (← links)
- Bounded quantifier depth spectra for random graphs (Q267173) (← links)
- When does the zero-one \(k\)-law fail? (Q325618) (← links)
- Universal zero-one \(k\)-law (Q325661) (← links)
- On the zero-one \(k\)-law extensions (Q338576) (← links)
- Extension of the zero-one \(k\)-law (Q403914) (← links)
- First-order and monadic properties of highly sparse random graphs (Q512509) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- On the spectra of first-order language properties for random graphs (Q892739) (← links)
- First order sentences about random graphs: small number of alternations (Q1693159) (← links)
- Logical laws for existential monadic second-order sentences with infinite first-order parts (Q1707156) (← links)
- Quantifier alternation in first-order formulas with infinite spectra (Q2190893) (← links)
- On limit points of spectra of first-order sentences with quantifier depth 4 (Q2211264) (← links)
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs (Q2309560) (← links)
- Infinite spectra of first-order properties for random hypergraphs (Q2314159) (← links)
- On the zero-one 4-law for the Erdős-Rényi random graphs (Q2353728) (← links)
- Monadic second-order properties of very sparse random graphs (Q2404656) (← links)
- Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations (Q2411789) (← links)
- Limit points of spectra for first-order properties of random hypergraphs (Q2659171) (← links)
- Short Monadic Second Order Sentences about Sparse Random Graphs (Q4562315) (← links)
- First-order properties of bounded quantifier depth of very sparse random graphs (Q4605739) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)