Pages that link to "Item:Q1066878"
From MaRDI portal
The following pages link to On random models of finite power and monadic logic (Q1066878):
Displayed 16 items.
- Finite-model theory -- A personal perspective (Q688663) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- The 0-1 law fails for monadic existential second-order logic on undirected graphs (Q1607080) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- Application of a Tauberian theorem to finite model theory (Q3753986) (← links)
- Zero-One Laws for Sparse Random Graphs (Q3791190) (← links)
- Asymptotic probabilities of existential second-order Gödel sentences (Q3984420) (← links)
- Counting finite models (Q4372920) (← links)
- Probabilities in first—order logic of a unary function and a binary relation (Q4697808) (← links)
- Convergence in homogeneous random graphs (Q4845076) (← links)
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview (Q4953235) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q5966661) (← links)