scientific article
From MaRDI portal
Publication:3874266
zbMath0435.06004MaRDI QIDQ3874266
Rohit Parikh, Dick H. J. de Jongh
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Total orders (06A05) Ordinal and cardinal numbers (03E10) Hierarchies of computability and definability (03D55)
Related Items (50)
Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen ⋮ Computable linearizations of well-partial-orderings ⋮ A chain decomposition theorem ⋮ ASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONS ⋮ Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition ⋮ Ordinal recursive bounds for Higman's theorem ⋮ Integer complexity and well-ordering ⋮ A partition theorem for ordinals ⋮ Generalized fusible numbers and their ordinals ⋮ Bachmann-Howard derivatives ⋮ Intermediate arithmetic operations on ordinal numbers ⋮ The length of an intersection ⋮ A characterisation of multiply recursive functions with Higman's lemma. ⋮ Some transfinite natural sums ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Internal structure of addition chains: well-ordering ⋮ On well-quasi-ordering finite structures with labels ⋮ Computing maximal chains ⋮ Unnamed Item ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ Lengths of developments in \(K((G))\) ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ Well Quasi-orderings and Roots of Polynomials in a Hahn Field ⋮ The Reverse Mathematics of wqos and bqos ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Higman’s Lemma and Its Computational Content ⋮ Analyzing Nash-Williams' partition theorem by means of ordinal types ⋮ Multiply-Recursive Upper Bounds with Higman’s Lemma ⋮ An order-theoretic characterization of the Howard-Bachmann-hierarchy ⋮ Jónsson posets ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Ordinal recursive complexity of unordered data nets ⋮ A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets ⋮ Well-partial-orderings and the big Veblen number ⋮ Levels of knowledge in distributed systems. ⋮ Two applications of analytic functors ⋮ An infinite natural product ⋮ Integer complexity: algorithms and computational results ⋮ REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION ⋮ The Parametric Complexity of Lossy Counter Machines ⋮ Complexity Hierarchies beyond Elementary ⋮ On Fraïssé's conjecture for linear orders of finite Hausdorff rank ⋮ A characterization of well-founded algebraic lattices ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
This page was built for publication:
