Pages that link to "Item:Q1893734"
From MaRDI portal
The following pages link to Infinitary logic and inductive definability over finite structures (Q1893734):
Displaying 27 items.
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- Computing with infinitary logic (Q672337) (← links)
- The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- A query language for NC (Q1376409) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
- Stability theory, permutations of indiscernibles, and embedded finite models (Q4505906) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- Computing on structures (Q4630296) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- The expressive power of fixed-point logic with counting (Q4879905) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- On the expressibility and the computability of untyped queries (Q5936000) (← links)
- Relation algebras from cylindric algebras. I (Q5956889) (← links)
- First order logic, fixed point logic and linear order (Q6560167) (← links)
- Game comonads \& generalised quantifiers (Q6597958) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
