Algebraic and logical descriptions of generalized trees

DOI10.23638/LMCS-13(3:7)2017zbMATH Open1459.03007arXiv1609.09675MaRDI QIDQ5367045FDOQ5367045

Authors: Bruno Courcelle 

Publication date: 12 October 2017

Full work available at URL: https://arxiv.org/abs/1609.09675

Recommendations

• Regularity equals monadic second-order definability for quasi-trees
• Several notions of rank-width for countable graphs
• On better quasi-ordering countable trees
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• On frontiers of regular trees

zbMATH Keywords

algebramonadic second-order logicquasi-treerank-widthordered treeregular term

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Higher-order logic (03B16)

Cited In (11)

• Title not available (Why is that?)
• Regularity equals monadic second-order definability for quasi-trees
• Pseudo-trees and Boolean algebras
• Betweenness of partial orders
• Title not available (Why is that?)
• Interpretations in trees with countably many branches
• Order-theoretic Trees: Monadic Second-order Descriptions and Regularity
• Betweenness in order-theoretic trees
• Axiomatization of betweenness in order-theoretic trees
• Several notions of rank-width for countable graphs
• Induced betweenness in order-theoretic trees

This page was built for publication: Algebraic and logical descriptions of generalized trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367045)