On better quasi-ordering countable trees

DOI10.1016/0012-365X(85)90127-XzbMath0575.05024MaRDI QIDQ1063615

E. Corominas

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

embeddingindecomposablecanonicalcountable treesordinal algebrasordinal isomorphism preserving infimums

Mathematics Subject Classification ID

Trees (05C05) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Ordered rings, algebras, modules (06F25)

Related Items (4)

Well, Better and In-Between ⋮ Obituary: Ernest Corominas ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ On Better-Quasi-Ordering Countable Series-Parallel Orders

Cites Work

• On Fraissé's order type conjecture
• An order type decomposition theorem
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On better quasi-ordering countable trees