The following pages link to (Q3874266):
Displaying 15 items.
- Computing maximal chains (Q453200) (← links)
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Integer complexity and well-ordering (Q887902) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION (Q4977220) (← links)
- ASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONS (Q5082063) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- Intermediate arithmetic operations on ordinal numbers (Q5108103) (← links)
- The length of an intersection (Q5108104) (← links)
- Some transfinite natural sums (Q5109243) (← links)
- Generalized fusible numbers and their ordinals (Q6050166) (← links)
- Bachmann-Howard derivatives (Q6103503) (← links)
