The following pages link to Elements of finite model theory. (Q703864):
Displaying 50 items.
- A logician's view of graph polynomials (Q2273013) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Whither semantics? (Q2286732) (← links)
- Zero-one laws for \(k\)-variable first-order logic of sparse random graphs (Q2309560) (← links)
- Difference hierarchies and duality with an application to formal languages (Q2310785) (← links)
- Zero-one laws for sentences with \(k\) variables (Q2332084) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- On the decidability of axiomatized mereotopological theories (Q2354622) (← links)
- Controlled query evaluation with open queries for a decidable relational submodel (Q2385449) (← links)
- Arity and alternation: a proper hierarchy in higher order logics (Q2385450) (← links)
- Process-centric views of data-driven business artifacts (Q2396822) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Message exchange games in strategic contexts (Q2409387) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- On the equivalence between FDs in XML and FDs in relations (Q2641879) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- Rational elements of summation semirings (Q2663048) (← links)
- The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- An infinitary system for the least fixed-point logic restricted to finite models (Q2866740) (← links)
- Using Evolution Graphs for Describing Topology-Aware Prediction Models in Large Clusters (Q2915044) (← links)
- Language Games (Q2963989) (← 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)
- Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (Q3012933) (← links)
- (Q3121527) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (Q3224003) (← links)
- Approximations of Mappings (Q3295272) (← links)
- Property Testing for Bounded Degree Databases (Q3304100) (← links)
- (Q3386630) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES (Q3532152) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Definability of Combinatorial Functions and Their Linear Recurrence Relations (Q3586014) (← links)
- Unary automatic graphs: an algorithmic perspective (Q3616222) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- Spoilt for Choice: Full First-Order Hierarchical Decompositions (Q3638288) (← links)
- Ehrenfeucht-Fraïssé Games on Random Structures (Q3638295) (← links)
