Abstract
The justification for the inclusion of a chapter on the basic facts and techniques of recursion theory is admirably summed up by Wilhelm Busch in the lines:
Also lautet ein Beschluß: Daß der Mensch was lernen muß — Nicht allein das A-B-C Bringt den Menschen in die Höh;
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
Barendregt, H. P.: 1981, Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam.
Barwise, J.: 1975, Admissible Sets and Structures, Springer-Verlag, Berlin.
Barwise, J. (ed.): 1977, Handbook of Mathematical Logic, North-Holland, Amsterdam.
Carnap, R.: 1937, The Logic Syntax of Language, Routledge and Kegan Paul, London.
Chang, C. C. and Keisler, H. J.: 1913, Model Theory, North-Holland, Amsterdam.
Davis, M.: 1958, Computability and Unsolvability, McGraw-Hill, New York.
Davis, M. (ed.): 1965, The Undecidable, Raven Press, New York.
Davis, M.: 1977, ‘Unsolvable problems’, in Barwise [1977] pp. 567–594.
Dreben, B. and Goldfarb, W. D.: 1979, The Decision Problem. Solvable Classes of Quantificational Formulas, Addison-Wesley, Reading, Mass.
Fenstad, J. E.: 1980, Generalized Recursion Theory: An Axiomatic Approach, Springer-Verlag, Berlin.
Fraenkel, A. A., Bar-Hillel, Y., Levy, A., and Van Dalen, D.: 1973, Foundations of Set Theory, North-Holland, Amsterdam.
Gabbay, D. M.: 1981, Semantical Investigations in Heyting’s Intuitionistic Logic, D. Reidel, Dordrecht.
Gandy, R.: 1980, ‘Church’s thesis and principles for mechanisms’, in J. Barwise, H. J. Keisler and K. Kunsn (eds.), Kleene Symposium, North-Holland, Amsterdam.
Gödel, K.: 1946, ‘Remarks before the Princeton Bicentennial Conference’, in Davis [1965].
Grzegorczyk, A.: 1961, Fonctions Récursives, Gauthier-Villars, Paris.
Hinman, P. G.: 1978, Recursion-Theoretic Hierarchies, Springer-Verlag, Berlin.
Hopcroft, J. E. and Ullman, J. D.: 1969, Formal Languages and Their Relations to Automata, Addison-Wesley, Reading, Mass.
Jeroslow, R. G.: 1972, On the Encodings Used in the Arithmetization of Metamathematics, University of Minnesota.
Kleene, S. C.: 1952, Introduction to Metamathematics, North-Holland, Amsterdam.
Kleene, S. C.: 1959, ‘Recursive functional and quantifiers of finite type 1’, Trans. Am. Math. Soc. 91, 1–52.
Kleene, S. C.: 1976, ‘The work of Kurt Gödel’, J. Symbolic Logic 41, 761–778.
Kleene, S. C.: 1981, ‘Origins of recursive function theory’, Ann. Hist. Comp. Sci. 3, 52–67.
Landau, E.: 1966, Foundations of Analysis, 3rd edn, Chelsea Publishing Co., New York.
Lewis, H. R.: 1979, Unsolvable Classes of Quantificational Formulas, Addison-Wesley, Reading, Mass.
Matijasevič, Y.: 1973, ‘Hilbert’s tenth problem’, in P. Suppes, L. Henkin, A. Joyal and G. C.Moisil (eds.), Logic, Methodology and Philosophy of Science, North-Holland, Amsterdam, pp. 89–110.
Mendelson, E.: 1979, Introduction to Mathematical Logic, Van No strand, New York.
Minsky, M.: 1967, Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, N.J.
Monk, D.: 1976, Mathematical Logic, Springer-Verlag, Berlin.
Moschovakis, Y.: 1974, Elementary Induction on Abstract Structures, North-Holland, Amsterdam.
Mostowski, A.: 1966, Thirty Years of Foundational Studies, Blackwell, Oxford.
Norman, D.: 1980, Recursion on the Countable Functional, Springer-Verlag, Berlin.
Pèter, R.: 1959, ‘Rekursivität und Konstruktivitat’, in A. Heyting (ed.), Constructivity in Mathematics, North-Holland, Amsterdam.
Rabin, M. O.: 1977, ‘Decidable theories’, in Barwise [1977], pp. 595–629.
Rogers, H.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
Schnorr, C. P.: 1974, Rekursive Funktionen und ihre Komplexität, Teubner, Stuttgart.
Shoenfield, J. R.: 1967, Mathematical Logic, Addison-Wesley, Reading, Mass.
Shoenfield, J. R.: 1971, Degrees of Unsolvability, North-Holland, Amsterdam.
Smoryński, C.: 1977, ‘The incompleteness theorems’, in Barwise [1977], pp. 821–866.
Smoryński, C.: 1981, ‘Fifty years of self-reference’, Notre Dame J. Formal Logic 22, 357–374.
Tarski, A.: 1951, A Decision Method for Elementary Algebra and Geometry, 2nd rev. edn. Berkeley.
Tarski, A., Mostowski, A., and Robinson, R. M.: 1953, Undecidable Theories, North-Holland, Amsterdam.
Troelstra, A. S.: 1973, Metamathematical Investigations of Intuitionistic Arithmetic and Analysis, Springer-Verlag, Berlin.
Turing, A.: 1936, ‘On computable numbers, with an application to the Enscheidungs-problem’, Proc. London Math. Soc. 42, 230–265 (Also in Davis [1965]).
Van Dalen, D.: 1981, Logic and Structure, Springer-Verlag, Berlin.
Van Heijenoort, J.: 1967, From Frege to Gödel. A Source Book in Mathematical Logic 1879–1931, Harvard Univ. Press, Cambridge, Mass.
Wang, Hao: 1974, From Mathematics to Philosophy, Routledge and Kegan Paul, London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 D. Reidel Publishing Company
About this chapter
Cite this chapter
Van Dalen, D. (1983). Algorithms and Decision Problems: A Crash Course in Recursion Theory. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic. Synthese Library, vol 164. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7066-3_6
Download citation
DOI: https://doi.org/10.1007/978-94-009-7066-3_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7068-7
Online ISBN: 978-94-009-7066-3
eBook Packages: Springer Book Archive