Zero-one law and definability of linear order

DOI10.2178/jsl/1231082304zbMath1168.03018OpenAlexW2129092123MaRDI QIDQ3616345

Hannu Niemistö

Publication date: 25 March 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1231082304

zbMATH Keywords

generalized quantifiersLindström quantifiersorder-invariant first-order logicfirst-order zero-one lawsordered random graphsrandom quantifiers

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13)

Cites Work

• 0-1 laws and decision problems for fragments of second-order logic
• Nonconvergence, undecidability, and intractability in asymptotic problems
• Infinitary logics and 0-1 laws
• How to define a linear order on finite models
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Strong extension axioms and Shelah's zero-one law for choiceless polynomial time