Infinite spectra in the first order theory of graphs

DOI10.1007/BF02122699zbMath0733.05051MaRDI QIDQ810048

J. H. Spencer

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

random graphsthreshold functioninfinite spectra

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13)

Related Items (15)

Spectra of short monadic sentences about sparse random graphs ⋮ On limit points of spectra of the random graph first-order properties ⋮ Bounded quantifier depth spectra for random graphs ⋮ Universal zero-one \(k\)-law ⋮ Short Monadic Second Order Sentences about Sparse Random Graphs ⋮ Limit points of spectra for first-order properties of random hypergraphs ⋮ Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations ⋮ On the spectra of first-order language properties for random graphs ⋮ Quantifier alternation in first-order formulas with infinite spectra ⋮ First order sentences about random graphs: small number of alternations ⋮ Bounded quantifier depth spectrum for random uniform hypergraphs ⋮ Threshold spectra via the Ehrenfeucht game ⋮ Infinite spectra of first-order properties for random hypergraphs ⋮ Zero-one laws for sentences with \(k\) variables ⋮ On the 4-spectrum of first-order properties of random graphs

Cites Work

• Zero-One Laws for Sparse Random Graphs
• Unnamed Item

This page was built for publication: Infinite spectra in the first order theory of graphs