The following pages link to (Q4850061):
Displaying 50 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Subshifts as models for MSO logic (Q384929) (← links)
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Locality and modular Ehrenfeucht-Fraïssé games (Q420850) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- Algorithmic correspondence for intuitionistic modal mu-calculus (Q483295) (← links)
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- XML queries and constraints, containment and reformulation (Q555769) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- FO(ID) as an extension of DL with rules (Q604911) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
- The navigational power of web browsers (Q692917) (← links)
- ``Backward'' coinduction, Nash equilibrium and the rationality of escalation (Q715039) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- The many faces of interpolation (Q1024113) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- First-order queries on databases embedded in an infinite structure (Q1350000) (← links)
- Canonization for two variables and puzzles on the square (Q1361251) (← links)
- Metafinite model theory (Q1383163) (← links)
- Analysis and application of adaptive sampling (Q1394792) (← links)
- Verification of relational transducers for electronic commerce (Q1394796) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Counting on CTL\(^*\): On the expressive power of monadic path logic (Q1398378) (← links)
- The Specker-Blatter theorem does not hold for quaternary relations (Q1399912) (← links)
- Quantifier rank for parity of embedded finite models. (Q1401237) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- On the structure of random unlabelled acyclic graphs. (Q1426116) (← links)
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
