The following pages link to (Q4255575):
Displayed 48 items.
- The axiomatics of ordered geometry: I. Ordered incidence spaces (Q533109) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- On the expressive power of monadic least fixed point logic (Q817849) (← links)
- Relational semantics for Kleene logic and action logic (Q817963) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Entropy of formulas (Q834714) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Harmonious logic: Craig's interpolation theorem and its descendants (Q1024116) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- Hybrid logic meets IF modal logic (Q1047800) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- XML with data values: Typechecking revisited. (Q1401966) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- On the lengths of symmetry breaking-preserving games on graphs (Q1885002) (← links)
- Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- An existential locality theorem (Q1887659) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- Arity and alternation: a proper hierarchy in higher order logics (Q2385450) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets (Q2576661) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- (Q4453869) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
- The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)