Strong 0-1 laws in finite model theory
From MaRDI portal
Publication:2710601
DOI10.2307/2695069zbMath0994.03027OpenAlexW1987875994MaRDI QIDQ2710601
Publication date: 24 April 2001
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695069
first-order logicinfinitary logicfinite structures0-1 laws\(\sigma\)-additive measureasymptotic sentences
Cites Work
- Unnamed Item
- Unnamed Item
- A logical approach to asymptotic combinatorics I. First order properties
- The computational complexity of asymptotic problems. I: Partial orders
- Infinitary logics and 0-1 laws
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Almost sure theories
- Probability with Martingales
This page was built for publication: Strong 0-1 laws in finite model theory