Zero-one laws for sentences with \(k\) variables

DOI10.1134/S1064562419030098zbMath1481.05143OpenAlexW4250403350WikidataQ114847311 ScholiaQ114847311MaRDI QIDQ2332084

M. E. Zhukovskii, A. Sarobidy Razafimahatratra

Publication date: 1 November 2019

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562419030098

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Bounded quantifier depth spectra for random graphs
• Elements of finite model theory.
• Threshold spectra via the Ehrenfeucht game
• Infinite spectra in the first order theory of graphs
• Infinitary logics and 0-1 laws
• Logical laws for existential monadic second-order sentences with infinite first-order parts
• On infinite spectra of first-order properties of random graphs
• Zero-One Laws for Sparse Random Graphs
• Probabilities on finite models
• Small subgraphs and their extensions in a random distance graph
• First-order properties of bounded quantifier depth of very sparse random graphs
• Random graphs: models and asymptotic characteristics

This page was built for publication: Zero-one laws for sentences with \(k\) variables