메뉴 건너뛰기




Volumn 37, Issue 3, 1998, Pages 149-165

Consistency proof via pointwise induction

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032385139     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530050089     Document Type: Article
Times cited : (8)

References (8)
  • 1
    • 0001407306 scopus 로고
    • A slow growing analogue to Buchholz' proof
    • Arai, T.: A slow growing analogue to Buchholz' proof. Ann. Pure Appl. Logic 54, 101-120 (1991)
    • (1991) Ann. Pure Appl. Logic , vol.54 , pp. 101-120
    • Arai, T.1
  • 2
    • 38249042320 scopus 로고
    • A new system of proof-theoretic ordinal functions
    • Buchholz, W.: A new system of proof-theoretic ordinal functions. Ann. Pure Appl. Logic 32, 195-207(1986)
    • (1986) Ann. Pure Appl. Logic , vol.32 , pp. 195-207
    • Buchholz, W.1
  • 5
    • 0003801679 scopus 로고
    • Subrecursion:Functions and hierarchies
    • Oxford: Oxford University Press
    • Rose, H.E.: Subrecursion:Functions and hierarchies. Oxford Logic Guides 9. Oxford: Oxford University Press 1984
    • (1984) Oxford Logic Guides , vol.9
    • Rose, H.E.1
  • 6
    • 77956968971 scopus 로고
    • Number theory and the Bachmann/Howard ordinal
    • Stern, J (ed.) Studies in Logic, Amsterdam: North-Holland
    • Schmerl U.: Number theory and the Bachmann/Howard ordinal. In: Stern, J (ed.) Proceedings of the Herbrand Symposium Logic Colloquim '81 (Studies in Logic, vol. 107, pp. 287-298). Amsterdam: North-Holland 1981
    • (1981) Proceedings of the Herbrand Symposium Logic Colloquim '81 , vol.107 , pp. 287-298
    • Schmerl, U.1
  • 7
    • 84972494127 scopus 로고
    • Proof of some theorems on recursively enumerable sets
    • Skolem, Th.: Proof of some theorems on recursively enumerable sets. Notre Dame J. of Formal Logic 3, 65-74 (1962)
    • (1962) Notre Dame J. of Formal Logic , vol.3 , pp. 65-74
    • Skolem, Th.1


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