Better-quasi-orderings and coinduction

DOI10.1016/S0304-3975(03)00131-2zbMath1081.06002DBLPjournals/tcs/Forster03WikidataQ56429962 ScholiaQ56429962MaRDI QIDQ1884898

Thomas Forster

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Abstract data types; algebraic specification (68Q65) Continuous lattices and posets, applications (06B35)

Related Items (2)

On the logical strength of the better quasi order with three elements ⋮ Upper Bounds on the Graph Minor Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• From wqo to bqo, via Ellentuck's theorem
• A note on well quasi-orderings for powersets
• On Fraissé's order type conjecture
• Well-quasi-orderings and sets of finite sequences
• Foundations of BQO Theory
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Fine analysis of the quasi-orderings on the power set

This page was built for publication: Better-quasi-orderings and coinduction