Pages that link to "Item:Q810005"

The following pages link to The structure of the models of decidable monadic theories of graphs (Q810005):

Displaying 42 items.

• Subshifts as models for MSO logic (Q384929) (← links)
• On the path-width of integer linear programming (Q515665) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Compactors for parameterized counting problems (Q826317) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Treewidth and logical definability of graph products (Q1006041) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
• A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
• Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
• Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
• Upper bounds to the clique width of graphs (Q1975365) (← links)
• Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
• Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
• On the width of regular classes of finite structures (Q2305404) (← links)
• Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• A model-theoretic characterisation of clique width (Q2503407) (← links)
• Monadic second-order logic and the domino problem on self-similar graphs (Q2694796) (← links)
• Simple monadic theories and indiscernibles (Q3077403) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
• Subshifts, Languages and Logic (Q3637233) (← links)
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
• Recognizability equals definability for partial k-paths (Q4572008) (← links)
• Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete (Q4639894) (← links)
• Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
• (Q5089180) (← links)
• (Q5089253) (← links)
• (Q5090942) (← links)
• (Q5091010) (← links)
• 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 (Q5387300) (← links)
• Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
• Computing with Tangles (Q5890774) (← links)
• Properties of graphs specified by a regular language (Q5896894) (← links)
• Properties of graphs specified by a regular language (Q5918788) (← links)
• Grid structures and undecidable constraint theories (Q5941204) (← links)