Gap Embedding for Well-Quasi-Orderings

DOI10.1016/S1571-0661(04)80846-6zbMath1264.03095MaRDI QIDQ4924530

Nachum Dershowitz, Iddo Tzameret

Publication date: 6 June 2013

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

Mathematics Subject Classification ID

Trees (05C05) Other combinatorial set theory (03E05)

Related Items

Fixed points and Noetherian topologies ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Orderings for term-rewriting systems
• Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item