The following pages link to (Q5551141):
Displaying 49 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Subshifts as models for MSO logic (Q384929) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algebraic and model-theoretic properties of tilings (Q596049) (← links)
- Faith \& falsity (Q705533) (← links)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Turing machine computations in finitely axiomatizable theories (Q1059628) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
- On elementary theories of graphs and Abelian loops (Q1219279) (← links)
- The theory of successor with an extra predicate (Q1243711) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Some notes on graph automata, tiling systems and partition logic (Q1273066) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Analysis and application of adaptive sampling (Q1394792) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Local properties of query languages (Q1575140) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Matrix hierarchies of first-order languages and their applications (Q1803010) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Virtual algebraic isomorphisms between predicate calculi of finite rich signatures (Q2145868) (← links)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic (Q2208242) (← links)
- The property of being a model complete theory is preserved by Cartesian extensions (Q2212696) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- Message-passing automata are expressively equivalent to EMSO logic (Q2503037) (← links)
- A decision problem for decision problems (Q2550382) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- Composition Over the Natural Number Ordering with an Extra Binary Relation (Q2947182) (← links)
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories (Q2959176) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- Communicating Finite-State Machines and Two-Variable Logic (Q3304111) (← links)
- Subshifts, Languages and Logic (Q3637233) (← links)
- Model-interpretability into trees and applications (Q4087166) (← links)
- (Q5009419) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Logische Kategorien (Q5632565) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
