The following pages link to Elements of finite model theory. (Q703864):
Displaying 50 items.
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- Metafinite model theory (Q1383163) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- A remark on the complexity of consistent conjunctive query answering under primary key violations (Q1675764) (← links)
- Relativised homomorphism preservation at the finite level (Q1680516) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Logical laws for existential monadic second-order sentences with infinite first-order parts (Q1707156) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false (Q1715478) (← links)
- Second-order propositional modal logic: expressiveness and completeness results (Q1731834) (← links)
- A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences (Q1732077) (← links)
- Expressive power of entity-linking frameworks (Q1740667) (← links)
- Relating structure and power: comonadic semantics for computational resources (extended abstract) (Q1798780) (← links)
- Relational hidden variables and non-locality (Q1956376) (← links)
- Expressivity of imperfect information logics without identity (Q1956377) (← links)
- Existential monadic second order convergence law fails on sparse random graphs (Q2011137) (← links)
- CompoSAT: specification-guided coverage for model finding (Q2024373) (← links)
- Consistent query answering for primary keys in Datalog (Q2035471) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- First-order complexity of subgraph isomorphism via Kneser graphs (Q2037624) (← links)
- Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment (Q2055791) (← links)
- Varieties (Q2074217) (← links)
- On the expressiveness of \textsc{Lara}: a proposal for unifying linear and relational algebra (Q2084947) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- Defining long words succinctly in FO and MSO (Q2104260) (← links)
- \(\gamma\)-variable first-order logic of uniform attachment random graphs (Q2113354) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- \( \gamma \)-variable first-order logic of preferential attachment random graphs (Q2127626) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Analogical proportions (Q2149806) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Model theoretical aspects of weakly aggregative modal logic (Q2155209) (← links)
- On definability of team relations with \(k\)-invariant atoms (Q2172825) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Partial fixed point for finite models in second order logic (Q2211373) (← links)
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination (Q2215958) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- On the convergence of probabilities of first-order sentences for recursive random graph models (Q2243792) (← links)
- MSO 0-1 law for recursive random trees (Q2244503) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Descriptive complexity of graph spectra (Q2273011) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
