Computable linearizations of well-partial-orderings

DOI10.1007/s11083-007-9058-0zbMath1124.03018OpenAlexW1974315792WikidataQ46858197 ScholiaQ46858197MaRDI QIDQ2385530

Antonio Montalbán

Publication date: 12 October 2007

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-007-9058-0

zbMATH Keywords

maximal order typewell-partial-ordering

Mathematics Subject Classification ID

Partial orders, general (06A06) Theory of numerations, effectively presented structures (03D45)

Related Items (8)

Cototal enumeration degrees and their applications to effective mathematics ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Computing maximal chains ⋮ The Reverse Mathematics of wqos and bqos ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Phase transitions of iterated Higman-style well-partial-orderings ⋮ A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets

Cites Work

• Graph minors. XX: Wagner's conjecture
• Pairs of recursive structures
• Computable structures and the hyperarithmetical hierarchy
• On operations and linear extensions of well partially ordered sets
• On Fraissé's order type conjecture
• The theory of well-quasi-ordering: a frequently discovered concept
• Recursive well-orderings
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable linearizations of well-partial-orderings