The following pages link to (Q4255575):
Displaying 50 items.
- Reasoning about negligibility and proximity in the set of all hyperreals (Q301366) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- First-order logic formalisation of impossibility theorems in preference aggregation (Q373021) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Sahlqvist theorem for modal fixed point logic (Q418010) (← links)
- Zero-one \(k\)-law (Q418871) (← links)
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Typical automorphism groups of finite nonrigid structures (Q494647) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- First-order and monadic properties of highly sparse random graphs (Q512509) (← links)
- The complexity of counting quantifiers on equality languages (Q515549) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- The axiomatics of ordered geometry: I. Ordered incidence spaces (Q533109) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Positive existential definability of parallelism in terms of betweenness in Archimedean ordered affine geometry (Q640271) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- Modal characterisation theorems over special classes of frames (Q732052) (← links)
- Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← 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 sentences about random graphs: small number of alternations (Q1693159) (← links)
- On the computation of zone and double zone diagrams (Q1704894) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Logical limit laws for minor-closed classes of graphs (Q1745738) (← 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)
- 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)
