The following pages link to Infinitary logics and 0-1 laws (Q1193591):
Displaying 50 items.
- On the expressive power of counting (Q672336) (← links)
- Computing with infinitary logic (Q672337) (← links)
- A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law (Q672725) (← links)
- The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
- A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Zero-one laws for modal logic (Q1337692) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- The Kolmogorov expression complexity of logics (Q1363784) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- 0-1 laws by preservation (Q1390939) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Arrow logic and infinite counting (Q1582310) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Pebble games and cospectral graphs (Q1689933) (← links)
- Logical laws for existential monadic second-order sentences with infinite first-order parts (Q1707156) (← links)
- Relating structure and power: comonadic semantics for computational resources (extended abstract) (Q1798780) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- A topological zero-one law and elementary equivalence of finitely generated groups (Q2220487) (← links)
- Descriptive complexity of graph spectra (Q2273011) (← links)
- Whither semantics? (Q2286732) (← links)
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs (Q2309560) (← links)
- Zero-one laws for sentences with \(k\) variables (Q2332084) (← links)
- The metamathematics of random graphs (Q2433743) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Strong 0-1 laws in finite model theory (Q2710601) (← links)
- On probabilistic elimination of generalized quantifiers (Q2748424) (← links)
- Nice infinitary logics (Q2879888) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (Q3224003) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- Zero-one law and definability of linear order (Q3616345) (← links)
- Almost everywhere elimination of probability quantifiers (Q3655247) (← links)
- (Q3984864) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic (Q4288891) (← links)
- Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic (Q4336698) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- Infinitary logics and very sparse random graphs (Q4358057) (← links)
- Stability, the finite cover property and 0-1 laws (Q4487256) (← links)
- SO(∀∃*) Sentences and Their Asymptotic Probabilities (Q4521119) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- Strong convergence in finite model theory (Q4779653) (← links)
- Expressibility of properties of relations (Q4858829) (← links)
- The expressive power of fixed-point logic with counting (Q4879905) (← links)
- (Q5013886) (← links)
