Almost sure theories
From MaRDI portal
Publication:3870879
DOI10.1016/0003-4843(80)90014-5zbMath0433.03020OpenAlexW2090008352MaRDI QIDQ3870879
Publication date: 1980
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(80)90014-5
Exact enumeration problems, generating functions (05A15) Model theory (03C99) Probability theory on algebraic and topological structures (60B99)
Related Items
Expansions of geometries ⋮ Zero-one laws with variable probability ⋮ A zero‐one law for a random subset ⋮ An undecidable problem in finite combinatorics ⋮ Nonconvergence, undecidability, and intractability in asymptotic problems ⋮ A logical approach to asymptotic combinatorics. II: Monadic second-order properties ⋮ Probabilities of Sentences about Very Sparse Random Graphs ⋮ Probabilities of First-Order Sentences about Unary Functions ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ Threshold Functions for Markov Chains: a Graph Theoretic Approach ⋮ The computational complexity of asymptotic problems. I: Partial orders ⋮ Metafinite model theory ⋮ Convergence in homogeneous random graphs ⋮ Logical laws for short existential monadic second-order sentences about graphs ⋮ Pseudofinite formulae ⋮ Asymptotic conditional probabilities: The non-unary case ⋮ Strong 0-1 laws in finite model theory ⋮ Infinity and verifiability in Carnap's inductive logic ⋮ Upper and lower bounds for first order expressibility ⋮ On the expressive power of counting ⋮ Infinitary logics and 0-1 laws ⋮ Metafinite model theory ⋮ On probabilistic elimination of generalized quantifiers ⋮ Finite-model theory -- A personal perspective ⋮ 0-1 laws for maps ⋮ On sets of relations definable by addition ⋮ Measures on cylindric algebras ⋮ Complexity classes and theories of finite models ⋮ On random models of finite power and monadic logic
