Pages that link to "Item:Q1425651"
From MaRDI portal
The following pages link to Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651):
Displaying 9 items.
- Countably complementable linear orderings (Q878148) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- Linear extensions of partial orders and reverse mathematics (Q3144869) (← links)
- Open Questions in Reverse Mathematics (Q3174640) (← links)
- Maximal compatible extensions of partial orders (Q3412789) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- There are 2^{ℵ₀} many 𝐻-degrees in the random reals (Q4813660) (← links)
- Up to equimorphism, hyperarithmetic is recursive (Q5718664) (← links)
