LEADER 03393nam 22006135 450 001 996466871703316 005 20230412151913.0 010 $a3-540-38020-5 024 7 $a10.1007/BFb0079542 035 $a(CKB)1000000000438303 035 $a(SSID)ssj0000320734 035 $a(PQKBManifestationID)12087861 035 $a(PQKBTitleCode)TC0000320734 035 $a(PQKBWorkID)10257699 035 $a(PQKB)10030159 035 $a(DE-He213)978-3-540-38020-7 035 $a(MiAaPQ)EBC5595277 035 $a(Au-PeEL)EBL5595277 035 $a(OCoLC)1076229865 035 $a(MiAaPQ)EBC6841800 035 $a(Au-PeEL)EBL6841800 035 $a(OCoLC)1292353833 035 $a(PPN)155210459 035 $a(EXLCZ)991000000000438303 100 $a20121227d1975 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aISILC - Proof Theory Symposion$b[electronic resource] $eDedicated to Kurt Schütte on the Occasion of His 65th Birthday. Proceedings of the International Summer Institute and Logic Colloquium, Kiel 1974 /$fherausgegeben von J. Diller, G.H. Müller 205 $a1st ed. 1975. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1975. 215 $a1 online resource (CD, 390 p.) 225 1 $aLecture Notes in Mathematics,$x1617-9692 ;$v500 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-07533-X 327 $aVerzeichnis der Publikationen von Kurt Schütte -- Normalfunktionen und Konstruktive Systeme von Ordinalzahlen -- Sound functors -- A study of generalized standardization in combinatory logic -- Intensionale Funktionalinterpretation der Analysis -- Non-extensional type-free theories of partial operations and classifications, I -- Kombinatorische Konstruktionen mit Beweisen und Schnittelimination -- Calculability of the primitive recursive functionals of finite type over the natural numbers -- Observations on a recent generalization of completeness theorems due to Schütte -- Strong normalization for arithmetic -- Intuitionistic completeness of a restricted second-order logic -- The real elements in a consistency proof for simple type theory I -- Church Rosser Theorem für ?-Kalküle mit Unendlich Langen Termen -- Über Skolemerweiterungen in der Intuitionistichen Logik mit Gleichheit -- Eine Variante des Bezeichnungssystems W(X) für Ordinalzahlen -- An upper bound for the provability of transfinite induction in systems with N-times iterated inductive definitions -- Comments on gentzen-type procedures and the classical notion of truth -- Bemerkungen zu Regel und Schema -- Infinite terms and recursion in higher types -- Consistency proofs and ordinals -- Markov's principle and Markov's rule for theores of choice sequences. 330 $aa. 410 0$aLecture Notes in Mathematics,$x1617-9692 ;$v500 606 $aMathematical logic 606 $aMathematical Logic and Foundations 615 0$aMathematical logic. 615 14$aMathematical Logic and Foundations. 676 $a511.36 700 $aDiller$b Justus$046332 702 $aMu?ller$b G. H$g(Gert Heinz),$f1923- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466871703316 996 $aISILC - Proof Theory Symposion$93091298 997 $aUNISA