메뉴 건너뛰기




Volumn 136, Issue 1-2, 2005, Pages 175-188

Inductive definitions over a predicative arithmetic

Author keywords

Inductive definitions; Omega rules; Predicative arithmetic; Provably recursive functions; Slow growing hierarchy

Indexed keywords


EID: 23944443494     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.05.011     Document Type: Article
Times cited : (4)

References (14)
  • 1
    • 0001407306 scopus 로고
    • A slow growing analogue of Buchholz' proof
    • T. Arai A slow growing analogue of Buchholz' proof Annals of Pure and Applied Logic 54 1991 101-120
    • (1991) Annals of Pure and Applied Logic , vol.54 , pp. 101-120
    • Arai, T.1
  • 2
    • 0032385139 scopus 로고    scopus 로고
    • Consistency proof via pointwise induction
    • T. Arai Consistency proof via pointwise induction Archive for Mathematical Logic 37 1998 149-165
    • (1998) Archive for Mathematical Logic , vol.37 , pp. 149-165
    • Arai, T.1
  • 3
    • 0034360168 scopus 로고    scopus 로고
    • Characterising the elementary recursive functions by a fragment of Gödel's T
    • A. Beckmann A. Weiermann Characterising the elementary recursive functions by a fragment of Gödel's T Archive for Mathematical Logic 39 2000 475-491
    • (2000) Archive for Mathematical Logic , vol.39 , pp. 475-491
    • Beckmann, A.1    Weiermann, A.2
  • 4
    • 0002602593 scopus 로고
    • A new recursion theoretic characterization of the polytime functions
    • S. Bellantoni S. Cook A new recursion theoretic characterization of the polytime functions Computational Complexity 2 1992 97-110
    • (1992) Computational Complexity , vol.2 , pp. 97-110
    • Bellantoni, S.1    Cook, S.2
  • 6
    • 33745286388 scopus 로고    scopus 로고
    • Hierarchies of provably recursive functions
    • S. Buss (Ed.) Elsevier Science BV
    • M. Fairtlough S.S. Wainer Hierarchies of provably recursive functions in: S. Buss (Ed.) Handbook of Proof Theory 1998 Elsevier Science BV 149-207
    • (1998) Handbook of Proof Theory , pp. 149-207
    • Fairtlough, M.1    Wainer, S.S.2
  • 9
    • 84957695133 scopus 로고
    • Intrinsic theories and computational complexity
    • D. Leivant (Ed.) Springer-Verlag Logic and Computational Complexity
    • D. Leivant Intrinsic theories and computational complexity in: D. Leivant (Ed.) Logic and Computational Complexity Lecture Notes in Computer Science vol. 960 1995 Springer-Verlag 177-194
    • (1995) Lecture Notes in Computer Science , vol.960 , pp. 177-194
    • Leivant, D.1
  • 11
    • 14644404764 scopus 로고    scopus 로고
    • Wainer Proof theoretic complexity
    • H. Schwichtenberg R. Steinbrüggen (Eds.) Kluwer Academic
    • G.E. Ostrin S.S. Wainer Proof theoretic complexity in: H. Schwichtenberg R. Steinbrÿggen (Eds.) Proof and System Reliability 2002 Kluwer Academic 369-397
    • (2002) Proof and System Reliability , pp. 369-397
    • Ostrin, G.E.1    Wainer, S.S.2
  • 13
    • 77956968971 scopus 로고
    • Number theory and the Bachmann-Howard ordinal
    • J. Stern (Ed.) North-Holland
    • U. Schmerl Number theory and the Bachmann-Howard ordinal in: J. Stern (Ed.) Logic Colloquium'81 1982 North-Holland 287-298
    • (1982) Logic Colloquium'81 , pp. 287-298
    • Schmerl, U.1
  • 14
    • 23944475797 scopus 로고    scopus 로고
    • Finitely iterated inductive definitions over a predicative arithmetic
    • Ph.D. Dissertation, Leeds
    • R.S. Williams, Finitely iterated inductive definitions over a predicative arithmetic, Ph.D. Dissertation, Leeds, 2004
    • (2004)
    • Williams, R.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.