Almost sure theories
From MaRDI portal
Publication:3870879
Cited in
(34)- On random models of finite power and monadic logic
- Nonconvergence, undecidability, and intractability in asymptotic problems
- A logical approach to asymptotic combinatorics I. First order properties
- The computational complexity of asymptotic problems. I: Partial orders
- Upper and lower bounds for first order expressibility
- Infinitary logics and 0-1 laws
- Metafinite model theory
- Infinity and verifiability in Carnap's inductive logic
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties
- Pseudofinite formulae
- Strong 0-1 laws in finite model theory
- On probabilistic elimination of generalized quantifiers
- Probabilities of First-Order Sentences about Unary Functions
- Expansions of geometries
- An undecidable problem in finite combinatorics
- Complexity classes and theories of finite models
- A zero‐one law for a random subset
- Probabilities of Sentences about Very Sparse Random Graphs
- 0-1 laws for maps
- Threshold Functions for Markov Chains: a Graph Theoretic Approach
- On sets of relations definable by addition
- Convergence in homogeneous random graphs
- Asymptotic conditional probabilities: The non-unary case
- Logical laws for short existential monadic second-order sentences about graphs
- Zero-one laws with variable probability
- Metafinite model theory
- On the expressive power of counting
- Asymptotic truth-value laws in many-valued logics
- Convergence laws for expansions of linear preorders
- Finite-model theory -- A personal perspective
- Random expansions of finite structures with bounded degree
- Random expansions of trees with bounded height
- A convergence law for continuous logic and continuous structures with finite domains
- Measures on cylindric algebras
This page was built for publication: Almost sure theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870879)
