scientific article; zbMATH DE number 7327944

MaRDI QIDQ5856415

No author found.

Publication date: 26 March 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

first-order logicmonadic second-order logicbetweennessquasi-treeorder-theoretic treejoin-tree

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (2)

Induced betweenness in order-theoretic trees ⋮ Betweenness of partial orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Several notions of rank-width for countable graphs
• Elements of finite model theory.
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Extensions of the Caucal hierarchy?
• Betweenness in graphs: a short survey on shortest and induced path betweenness
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Approximating clique-width and branch-width
• Regularity Equals Monadic Second-Order Definability for Quasi-trees
• AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
• Betweenness of partial orders
• Betweenness in Order-Theoretic Trees
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Mathematical Foundations of Computer Science 2003

This page was built for publication: