메뉴 건너뛰기




Volumn 1683, Issue , 1999, Pages 389-404

Open least element principle and bounded query computation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

EID: 35048857726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_28     Document Type: Conference Paper
Times cited : (3)

References (10)
  • 1
    • 0031584264 scopus 로고    scopus 로고
    • Induction rules, reflection principles, and provably recursive functions
    • L.D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of Pure and Applied Logic, 85:193-242, 1997.
    • (1997) Annals of Pure and Applied Logic , vol.85 , pp. 193-242
    • Beklemishev, L.D.1
  • 3
    • 0040588397 scopus 로고    scopus 로고
    • Introduction to Proof Theory
    • S.R. Buss, editor, Elsevier, North-Holland, Amsterdam
    • S.R. Buss. Introduction to Proof Theory. In S.R. Buss, editor, Handbook of Proof Theory, pages 1-78. Elsevier, North-Holland, Amsterdam, 1998.
    • (1998) Handbook of Proof Theory , pp. 1-78
    • Buss, S.R.1
  • 4
    • 0001773686 scopus 로고
    • Open problems
    • editors, Arithmetic, Proof Theory, and Computational Complexity, Oxford Uni- versity Press, Oxford
    • P. Clote and J. Krajíček. Open problems. In P. Clote and J. Krajıček, editors, Arithmetic, Proof Theory, and Computational Complexity, pages 1-19. Oxford Uni- versity Press, Oxford, 1993.
    • (1993) P. Clote and J. Krajıček , pp. 1-19
    • Clote, P.1    Krajíček, J.2


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