Derivation Lengths Classification of Gödel's T Extending Howard's Assignment

@article{Wilken2012DerivationLC,
  title={Derivation Lengths Classification of G{\"o}del's T Extending Howard's Assignment},
  author={Gunnar Wilken and Andreas Weiermann},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={8}
}
Let T be Gödel’s system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of natural numbers such that if a term A reduces to a term B and if a natural number I(A) is assigned to A then a natural number I(B) can be assigned to B such that I(A) is greater than I(B). The construction of I is based on Howard’s 1970 ordinal assignment for T… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
2 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A Uniform Approach to Fundamental Sequences and Hierarchies

  • W. Buchholz, E. A. Cichon, A. Weiermann
  • Mathematical Logic Quarterly
  • 1994
Highly Influential
4 Excerpts

Assignment of Ordinals to Terms For Primitive Recursive Functionals of Finite Type. Intuitionism and Proof Theory, 443–458

  • W. A. Howard
  • 1970
Highly Influential
10 Excerpts

Proof Theory. The First Step into Impredicativity

  • W. Pohlers
  • 2009
1 Excerpt

Weiermann,A.: A term rewriting characterization of the polytime functions and related complexity classes

  • A. Beckmann
  • Archive for Mathematical Logic
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…