Ordinal recursive bounds for Higman's theorem

Theoretical Computer Science

Volumn 201, Issue 1-2, 1998, Pages 63-84

  Cichon, E A ^a   Bittar, E Tahhan ^b  

^a INRIA   (France)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011653638     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00009-1     Document Type: Article

References (18)

1. E.A. Cichon, A short proof of two recently discovered independence results using recursion theoretic methods, Proc. Amer. Math. Soc. 87 (1983).
2. E.A. Cichon and H. Touzet, An ordinal calculus for proving termination in term rewriting, Proc. Conf. on Trees in Algebra and Programming - CAAP 96, Lecture Notes in Computer Science, Vol. 1059 (1996).
3. D.H.J. De Jongh and R. Parikh, Well partial orderings and hierarchies, Reprint from the Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, Ser. A, Vol. 80(3) (1977).
4. E. Dennis-Jones and S.S. Wainer, Subrecursive hierarchies via direct limits, in: Richter, Borger, Oberschelp, Schinzel and Thomas, eds., Logic Colloquium 83, Lecture Notes in Mathematics, Vol. 1104 (Springer, Berlin, 1984) 117-128.
5. M.V.H. Fairtlough and S.S. Wainer, Ordinal Complexity of Recursive Definitions, Inform. and Comput. 99(2) (1992).
6. 0. A survey of some results in proof theory, Ann. Pure Appl. Logic 53 (1991).
7. 2 Logic, Part 1, Ann. Math. Logic 21 (1981) 75-219.
8. A. Grzegorczyk, Some classes of recursive functions, Rozprawy Matematyczne 4 (1953).
9. P. Jullien, Analyse combinatoire: sur un théorème d'extension dans la théorie des mots, C. R. Acad. Sci Paris, Ser. A 266 (1968).
10. L.A.S. Kirby and J. Paris, Accessible independence results for Peano arithmetic, Bull. London Math. Soc. 14 (1982).
11. C.R. Murthy and J.R. Russell, A constructive proof of Higman's lemma, Proceedings of the fifth annual IEEE Symposium on Logic in Computer Science (1990) 257-267.
12. R. Péter, Recursive Functions (Academic Press, New York, 1967).
13. J.W. Robbin, Subrecursive hierarchies. PhD thesis, Princeton, 1965.
14. K. Schütte and S.G. Simpson, Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen, Archiv für mathematische Logik und Grundlagenforschung 25 (1985) 75-89.
15. H. Schwichtenberg, Rekursionzahlen und die Grzegorczyk-Hierarchie, Arch. Math. Logik 12 (1969) 85-97.
16. 0-rekursiven Funktionen, Zeit. Math. Logik 17 (1971) 61-74.
17. S.S. Wainer, A classification of the ordinal recursive functions, Arch. Math. Logik 13 (1970) 136-153.
18. S.S. Wainer, Ordinal recursion and a refinement of the extended Grzegorczyk hierarchy, J. Symbol. Logic 37 (1972) 281-292.