Abstract
The first need for a systematic study of functions whose values can be calculated by a finite process (usually called computable) can be found in the Hilbert school. It was connected with the decision problem for first-order logic (and in general, for first-order theories) considered by Hilbert and his students in connection with the Hilbert program. The aim of this program was to justify classical mathematics by finitistic means.
This paper was written in the framework of the research project ‘Mathematical logic in Poland: origins, development, import’ realized at the Jagiellonian University (Krakow) — Committee for Scientific Research (KBN) grant No. PB 1084/91. The upper bound of the period covered in the project was fixed as 1963.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Addison, J.W.: 1954, On some points of the theory of recursive functions, unpublished doctoral dissertation, University of Wisconsin.
Addison, J.W.: 1958, ‘Separation principles in the hierarchies of the classical and effective descriptive set theory’, Fundamenta Mathematicae 46, pp. 123–135.
Banach, S., Mazur, S.: 1937, ‘Sur le fonctions calculables’, Annates de la Société Polonaise de Mathématique 16, p. 223.
Bernays, P.: 1937, ‘A system of axiomatic set theory’, Part I, Journal of Symbolic Logic 2, pp. 65–77.
Carnap, R.: 1934, Logische Syntax der Sprache, J. Springer, Vienna.
Gödel, K.: 1931, ‘Über formal unentscheidbare Sätze der ‘Principia Mathematica’ und verwandter Systeme. I’, Monatshefte für Mathematik und Physika, 38, pp. 173–198.
Gödel, K.: 1958, ‘Über eine noch nicht benützte Erweiterung des flniten Standpunktes’, Dialectica 12, pp. 280–287.
Grzegorczyk, A.: 1953, ‘Some classes of recursive functions’, Rozprawy Matematyczne 4, pp. 1–46.
Grzegorczyk, A.: 1955a, ‘Computable functionals’, Fundamenta Mathematicae 42, pp. 168–202.
Grzegorczyk, A.: 1955b, ‘Elementarily definable analysis’, Fundamenta Mathematicae 41, pp. 311–338.
Grzegorczyk, A.: 1955c, ‘On the definition of computable functionals’, Fundamenta Mathematicae 42, pp. 232–239.
Grzegorczyk, A.: 1957, ‘On the definitions of computable real continuous functions’, Fundamenta Mathematicae 44, pp. 61–71.
Grzegorczyk, A.: 1959, ‘Some approaches to constructive analysis’, in Constructivity in Mathematics. Proceedings of the Colloquium held at Amsterdam, 1957, ed. by A. Heyting, North-Holland Publishing Company, Amsterdam, pp. 43–61.
Grzegorczyk, A.: 1962, ‘A theory without recursive models’, Bulletin de l’Academie Polonaise de Sciences, Série des sciences math., astr. etphys. 10, pp. 63–69.
Grzegorczyk, A.: 1962a, ‘An example of two weak essentially undecidable theories F and F*‘, Bulletin de l’Académie Polonaise des Sciences, Série des sciences math., astr. etphys. 10, pp. 5–9.
Grzegorczyk, A.: 1964, ‘Recursive objects in all finite types’, Fundamenta Mathematicae 54, pp. 73–93.
Hensel, G., Putnam, H.: 1969, ‘Normal models and the field Σ1*’, Fundamenta Mathematicae 64, pp. 231–240.
Janiczak, A.: 1955, ‘Some remarks on partially recursive functions’, Colloquium Mathematicum 3, pp. 37–38.
Kalmár, L.: 1943, ‘Egyszerü példa eldönthetetlen aritmetikai problémára’, Matematikai és Fizikai Lapok 50, pp. 1–23.
Kleene, S.C.: 1943, ‘Recursive predicates and quantifiers’, Transactions of the American Mathematical Society 53, pp. 41–83.
Kleene, S.C.: 1955, ‘Arithmetical predicates and function quantifiers’, Transactions of the American Mathematical Society 79, pp. 312–340.
Kleene, S.C.: 1959, ‘Recursive functionals and quantifiers of finite types. I’, Transactions of the American Mathematical Society 91, pp. 1–52.
Kreisel, G.: 1953, ‘Note on arithmetic models for consistent formulae of the predicate calculus. II, in Proceedings of the XIth International Congress of Philosophy, vol. XIV, North-Holland Publishing Company, Amsterdam-Louvain, pp. 39–49.
Kreisel, G.: 1959, ‘Interpretation of analysis by means of constructive functionals of finite types’, in Constructivity in Mathematics. Proceedings of the Colloquium held at Amsterdam, 1957, ed. by A. Heyting, North-Holland Publishing Company, Amsterdam, pp. 101–128.
Löb, M.H., Wainer, S.S.: 1970a, ‘Hierarchies of number-theoretic functions. I’, Archiv für Mathematische Logik und Grundlagenforschung 13, pp. 39–51.
Löb, M.H., Wainer, S.S.: 1970b, ‘Hierarchies of number-theoretic functions. II, Archiv für Mathematische Logik und Grundlagenforschung 13, pp. 97–113.
Mazur, S.: 1963, ‘Computable analysis’, ed. by A. Grzegorczyk and H. Rasiowa, Rozprawy Matematyczne 33, pp. 1–111.
Mostowski, A.: 1947, ‘On definable sets of positive integers’, Fundamenta Mathematicae 34, pp. 81–112.
Mostowski, A.: 1948, ‘On a set of integers not definable by means of one-quantifier predicate’, Annales de la Société Polonaise de Mathématique 21, pp. 114–119.
Mostowski, A.: 1949, ‘Sur 1’interpretation géométrique et topologique des notions logiques’, in Actes du X-ème Congres International de Philosophie (Amsterdam 11–18 août 1948), North-Holland Publishing Company, Amsterdam, pp. 610–617.
Mostowski, A.: 1951, ‘A classification of logical systems’, Studia Philosophica 4, pp. 237–274.
Mostowski, A.: 1952, Sentences Undecidable in Formalized Arithmetic. An Exposition of the Theory of Kurt Gödel, North-Holland Publishing Company, Amsterdam.
Mostowski, A.: 1953, ‘On a system of axioms which has no recursively enumerable arithmetical model’, Fundamenta Mathematicae 40, pp. 56–61.
Mostowski, A.: 1955, ‘Examples of sets definable by means of two and three quantifiers’, Fundamenta Mathematicae 42, pp. 259–270.
Mostowski, A.: 1955a, ‘A formula with no recursively enumerable model’, Fundamenta Mathematicae 42, pp. 125–140.
Mostowski, A.: 1955b, ‘The present state of investigations on the foundations of mathematics’, in collaboration with A. Grzegorczyk, S. Jaśkowski, J. Łoś, S. Mazur, H. Rasiowa and R. Sikorski, Rozprawy Matematyczne 9, pp. 1–48.
Mostowski, A.: 1957, ‘On recursive models of formalised arithmetic’, Bulletin de de l’Académie Polonaise de Sciences (Cl. III) 5, pp. 705–710.
Mostowski, A.: 1959, ‘On various degrees of constructivism’, in Constructivity in Mathematics. Proceedings of the Colloquium held at Amsterdam, 1957, ed. A. Heyting, North-Holland Publishing Company, Amsterdam, pp. 178–194.
Peter, R.: 1951, Rekursive Funktionen, Akadémiai Kiadó, Budapest.
Post, E.: 1944, ‘Recursively enumerable sets of positive integers and their decision problems’, Bulletin of the American Mathematical Society 50, pp. 284–316.
Putnam, H.: 1965, ‘Trial and error predicates and the solution to a problem of Mostowski’, Journal of Symbolic Logic 30, pp. 49–57.
Rosser, J.B.: 1937, ‘Gödel’s theorem for non constructive logic’, Journal of Symbolic Logic 2, pp. 129–137.
Specker, E.: 1949, ‘Nichtkonstruktiv beweisbare Sätze der Analysis’, Journal of Symbolic Logic 14, pp. 145–158.
Wainer, S.S.: 1970, ‘A classification of the ordinal recursive functions’, Archiv für Mathematische Logik und Grundlagenforschung 13, pp. 136–153.
Weyl, H.: 1918, Das Kontinuum. Kritische Untersuchungen über die Grundlagen der Analysis, Veit, Leipzig.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Murawski, R. (1998). The Contribution of Polish Logicians to Recursion Theory. In: Kijania-Placek, K., Woleński, J. (eds) The Lvov-Warsaw School and Contemporary Philosophy. Synthese Library, vol 273. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5108-5_22
Download citation
DOI: https://doi.org/10.1007/978-94-011-5108-5_22
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6146-9
Online ISBN: 978-94-011-5108-5
eBook Packages: Springer Book Archive