The following pages link to (Q3874266):
Displaying 50 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)
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank (Q1032636) (← links)
- Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets) (Q1066924) (← links)
- A chain decomposition theorem (Q1109796) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- A partition theorem for ordinals (Q1135852) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Analyzing Nash-Williams' partition theorem by means of ordinal types (Q1191918) (← links)
- A characterisation of multiply recursive functions with Higman's lemma. (Q1400716) (← links)
- Internal structure of addition chains: well-ordering (Q1704595) (← links)
- Lengths of developments in \(K((G))\) (Q1726002) (← links)
- An infinite natural product (Q1790445) (← links)
- Jónsson posets (Q1991606) (← links)
- Minimal bad sequences are necessary for a uniform Kruskal theorem (Q2125990) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Well-partial-orderings and the big Veblen number (Q2257112) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition (Q2402963) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders (Q3295145) (← links)
- Well Quasi-orderings and Roots of Polynomials in a Hahn Field (Q3295148) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Well-Partial Orderings and their Maximal Order Types (Q3295157) (← links)
- Higman’s Lemma and Its Computational Content (Q3305561) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen (Q3718711) (← links)
- A characterization of well-founded algebraic lattices (Q4634989) (← links)
- REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION (Q4977220) (← links)
- Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees (Q5013906) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← 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)
- Integer complexity: algorithms and computational results (Q5384256) (← links)
- Levels of knowledge in distributed systems. (Q5955752) (← links)
- Two applications of analytic functors (Q5958294) (← links)
- Generalized fusible numbers and their ordinals (Q6050166) (← links)
- Bachmann-Howard derivatives (Q6103503) (← links)
- Notes on my scientific life (Q6612807) (← links)
