The following pages link to (Q3758820):
Displayed 46 items.
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- First-order spectra with one variable (Q909462) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Fixed-point extensions of first-order logic (Q1090327) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
- Reflective relational machines (Q1271557) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Formal frameworks for approximate reasoning (Q1311748) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Metafinite model theory (Q1383163) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Relativised homomorphism preservation at the finite level (Q1680516) (← links)
- On the expressive power of data dependencies (Q1822528) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries (Q2274499) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Exact Query Reformulation with First-Order Ontologies and Databases (Q2915072) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- A Logic for PTIME and a Parameterized Halting Problem (Q3586007) (← links)
- Computing on structures (Q4630296) (← links)
- Tailoring recursion for complexity (Q4632420) (← links)
- (Q4638077) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- The Context of Inference (Q5208107) (← links)
- The concept of truth in a finite universe (Q5928928) (← links)
- On the expressibility and the computability of untyped queries (Q5936000) (← links)
- Metafinite model theory (Q6064289) (← links)
- Preservation theorems in finite model theory (Q6064296) (← links)