zbMATH — the first resource for mathematics

Experimental logics and \(\Delta^0_2\)-theories. (English) Zbl 0319.02024

03F99 Proof theory and constructive mathematics
03D80 Applications of computability and recursion theory
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
03D55 Hierarchies of computability and definability
Full Text: DOI
[1] S.Feferman, ’The Arithmetization of Metamathematics in a General Setting’, Fundamenta Mathematicae XLIV (1960), 35–92. · Zbl 0095.24301
[2] G.Gentzen, ’Die Widerspruchsfreiheit der reinen Zahlentheorie’, Mathematische Annalen 112 (1936), 493–565. An English translation is in The Collected Papers Gerhard Gentzen, M.E. Szabo, editor, North-Holland Publishing Company, 1969, 338 pp. · Zbl 0014.38801
[3] K.Gödel, ’Ueber formal unentscheidbare Satze der Principia Mathematica und verwanter Systeme’, Monatschefte fur Mathematik und Physik 38 (1931), 173–198.
[4] E.M.Gold, ’Limiting Recursion’, The Journal of Symbolic Logic 30 (March 1965), 28–48. · Zbl 0203.01201
[5] L.Henkin, ’The Completeness of the First-Order Functional Calculus’, The Journal of Symbolic Logic 14 (September 1949), 159–166. · Zbl 0034.00602
[6] D.Hilbert, ’Uber das Unendliche’, Mathematische Annalen 95 (1926), 161–190. · JFM 51.0044.02
[7] R.G. Jeroslow, ’On Godel’s Consistency Theorem’, manuscript from the School of Mathematics, University of Minnesota, dated July, 1971, p. 72
[8] R.G. Jeroslow, ’Two Theorems on Experimental Logics’, Research Report 73-4, From the Department of Mathematics, Carnegie-Mellon University, distributed in February 1973. p. 11 · Zbl 0283.90029
[9] G.Kreisel, ’Mathematical Logic’, in Lectures on Modern Mathematics, Vol. 3, (ed. by T.L.Saaty), Wiley and Sons, New York, 1963–1965.
[10] G.Kreisel and A.Levy, ’Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems’, Zeitschrift f. math. Logik und Grundlagen d. Math. 14 (1968), 97–142. · Zbl 0167.01302
[11] R.Magari, ’Su certe teorie non enumerabili (Sulle Limitazioni dei sistemi formali, I)’, Ann. Mat. Pura Appl. (IV) XCVIII (1974), 119–152. · Zbl 0286.02051
[12] R. Magari, ’Significato e verita nell aritmetica planiana (Sulle limitazioni dei sistemi formali, II)’, to appear in Ann. Mat. Pura Appl.; abstract has appeared in Accademia Nazionale dei Lincei, serie VIII, LIV, fasc. 6, Guigno, (1973), 903–903.
[13] H.Putnam, ’Trial and Error Predicates and the Solution to a Problem of Mostowski’, The Journal of Symbolic Logic 30 (March 1965), 49–57. · Zbl 0193.30102
[14] H.RogersJr., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, New York, 1967, 457 pp.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.