Pages that link to "Item:Q2385530"
From MaRDI portal
The following pages link to Computable linearizations of well-partial-orderings (Q2385530):
Displaying 9 items.
- Computing maximal chains (Q453200) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Phase transitions of iterated Higman-style well-partial-orderings (Q661281) (← links)
- A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- An order‐theoretic characterization of the Schütte‐Veblen‐Hierarchy (Q4304120) (← links)
- Cototal enumeration degrees and their applications to effective mathematics (Q4563667) (← links)
