SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 275-292

Elementary arithmetic

(2) Ostrin, Geoff E a Wainer, S S b

a UNIVERSITY OF BERN (Switzerland)

b UNIVERSITY OF LEEDS (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14644424669 PISSN: 01680072 EISSN: None Source Type: Journal
DOI: 10.1016/j.apal.2004.10.012 Document Type: Article

Times cited : (7)

References (10)

1
- 0002602593
- 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.¹ Cook, S.²

2
- 0034258798
- Fragments of Heyting arithmetic
- W. Burr Fragments of Heyting arithmetic Journal of Symbolic Logic 65 2000 1223-1240
- (2000) Journal of Symbolic Logic , vol.65 , pp. 1223-1240
- Burr, W.¹

3
- 0003869406
- Bounded arithmetic
- S.R. Buss Bounded arithmetic Bibliopolis 1986
- (1986) Bibliopolis
- Buss, S.R.¹

4
- 14644407288
- Proof theoretic complexity of low subrecursive classes
- F.L. Bauer R. Steinbrueggen (Eds.) NATO ASI Series F IOS Press
- Cagman N Ostrin G.E. Wainer S.S. Proof theoretic complexity of low subrecursive classes in: F.L. Bauer R. Steinbrueggen (Eds.) Foundations of Secure Computation, NATo ASI Series F, vol. 175 IOS Press 2000 249-285
- (2000) Foundations of Secure Computation , vol.175 , pp. 249-285
- Cagman, N.¹ Ostrin, G.E.² Wainer, S.S.³

5
- 14644404764
- Proof theoretic complexity
- H. Schwichtenberg R. Steinbrüggen (Eds.) Kluwer Academic
- Ostrin G.E. Wainer S.S. Proof theoretic complexity in: H. Schwichtenberg R. Steinbrüggen (Eds.) Proof and System Reliability, Kluwer Academic 2002 369-397
- (2002) Proof and System Reliability , pp. 369-397
- Ostrin, G.E.¹ Wainer, S.S.²

6
- 33745286388
- 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.¹ Wainer, S.S.²

7
- 84957695133
- Intrinsic theories and computational complexity
- D. Leivant (Ed.) Lecture Notes in Computer Science Springer-Verlag
- 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) Logic and Computational Complexity , vol.960 , pp. 177-194
- Leivant, D.¹

8
- 14644439690
- Klassen rekursiver funktionen
- M.H. Löb (Ed.) Lecture Notes in Mathematics Springer-Verlag
- D. Rödding Klassen rekursiver funktionen in: M.H. Löb (Ed.) Proc. of Summer School in Logic Leeds 1967, Lecture Notes in Mathematics vol. 70 1968 Springer-Verlag 159-222
- (1968) Proc. of Summer School in Logic Leeds 1967 , vol.70 , pp. 159-222
- Rödding, D.¹

9
- 0003260331
- Basic Proof Theory
- Cambridge University Press
- A.S. Troelstra H. Schwichtenberg Basic Proof Theory Cambridge Tracts in Theoretical Computer Science vol. 43 1996 Cambridge University Press
- (1996) Cambridge Tracts in Theoretical Computer Science , vol.43
- Troelstra, A.S.¹ Schwichtenberg, H.²

10
- 0031473688
- 1-induction
- 1-induction Archive for Mathematical Logic 37 1997 37-49
- (1997) Archive for Mathematical Logic , vol.37 , pp. 37-49
- Wehmeier, K.F.¹

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