The following pages link to (Q3666827):
Displaying 50 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Model-checking hierarchical structures (Q414908) (← 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)
- Monadic partition logics and finite automata (Q671644) (← links)
- On the expressive power of counting (Q672336) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- Categoricity over P for first order T or categoricity for \(\phi\) \(\in {\mathcal L}_{\omega_ 1\omega}\) can stop at \(\aleph_ k\) while holding for \(\aleph_ 0,\dots ,\aleph_{k-1}\) (Q757348) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- First-order spectra with one variable (Q909462) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- Query languages for bags and aggregate functions (Q1376407) (← links)
- Finitely representable databases (Q1376408) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Analysis and application of adaptive sampling (Q1394792) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- Local properties of query languages (Q1575140) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Expressive power of entity-linking frameworks (Q1740667) (← links)
- Logical limit laws for minor-closed classes of graphs (Q1745738) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Shrinking games and local formulas (Q1877096) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- An existential locality theorem (Q1887659) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Decision problems in a logic for reasoning about reconfigurable distributed systems (Q2104556) (← links)
- Constructing decidable graphs from decidable structures (Q2300933) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Language Games (Q2963989) (← links)
