Pages that link to "Item:Q598280"
From MaRDI portal
The following pages link to Algorithmic uses of the Feferman-Vaught theorem (Q598280):
Displaying 50 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Continuous time temporal logic with counting (Q418179) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- The independence polynomial of rooted products of graphs (Q968175) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Singularities in Negami's splitting formula for the Tutte polynomial (Q1701095) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Game-based notions of locality over finite models (Q2478544) (← links)
- On the colored Tutte polynomial of a graph of bounded treewidth (Q2492206) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- On countable chains having decidable monadic theory (Q2892678) (← links)
- Complexity of Ising Polynomials (Q2911072) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees (Q3605529) (← links)
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (Q3618564) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS (Q3646170) (← links)
- Tarski’s Influence on Computer Science (Q4611682) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Bisimulation Invariant Monadic-Second Order Logic in the Finite (Q5002802) (← links)
- (Q5002820) (← links)
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. (Q5005180) (← links)
- (Q5009461) (← links)
- (Q5094135) (← links)
