The following pages link to (Q4255575):
Displayed 50 items.
- 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)
- Strictly balanced uniform hypergraphs and generalizations of zero-one law (Q2124632) (← links)
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem (Q2133477) (← links)
- Analogical proportions (Q2149806) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Descriptive complexity of graph spectra (Q2273011) (← links)
- Two first-order logics of permutations (Q2299614) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- Infinite spectra of first-order properties for random hypergraphs (Q2314159) (← links)
- On compactness of logics that can express properties of symmetry or connectivity (Q2350211) (← links)
- Spectra of short monadic sentences about sparse random graphs (Q2358597) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← 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)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Monadic second-order properties of very sparse random graphs (Q2404656) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← 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)
- Limit points of spectra for first-order properties of random hypergraphs (Q2659171) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Rational elements of summation semirings (Q2663048) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers (Q2974792) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
- Approximations of Mappings (Q3295272) (← links)
- On Enumerating Query Plans Using Analytic Tableau (Q3455780) (← 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)