Regularity Equals Monadic Second-Order Definability for Quasi-trees

DOI10.1007/978-3-319-23534-9_7zbMath1465.03072OpenAlexW2293989599MaRDI QIDQ2947169

No author found.

Publication date: 22 September 2015

Published in: Fields of Logic and Computation II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23534-9_7

Mathematics Subject Classification ID

Second- and higher-order model theory (03C85) Models of other mathematical theories (03C65) Model theory of denumerable and separable structures (03C15)

Related Items (3)

Betweenness in Order-Theoretic Trees ⋮ Unnamed Item ⋮ Regularity Equals Monadic Second-Order Definability for Quasi-trees

Cites Work

• Several notions of rank-width for countable graphs
• Fundamental properties of infinite trees
• Clique-width of countable graphs: A compactness property.
• Clique-sums, tree-decompositions and compactness
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• Regularity Equals Monadic Second-Order Definability for Quasi-trees
• On frontiers of regular trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regularity Equals Monadic Second-Order Definability for Quasi-trees