Skip to main content
SpringerLink
Log in
Book cover

Modern Logic — A Survey pp 173–195Cite as

Recursion Theory

  • Chapter

  • 243 Accesses

Part of the book series: Synthese Library ((SYLI,volume 149))

Abstract

The theory of recursive functions can be characterized as a general theory of computation. It has been created in the twentieth century.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Ackermann, W., ‘Zum Hilbertschen Aufbau der reellen Zahlen’, Math. Ann. 99 (1928), 118–133.

    Article  Google Scholar 

  • Ackermann, W., Solvable Cases of the Decision Problem, North-Holland, Amsterdam, 1954, 121 pp.

    Google Scholar 

  • Aho, A. V. (ed.), Currents in the Theory of Computing, Prentice-Hall, Englewood Cliffs, N.J., 1973, 255 pp.

    Google Scholar 

  • Asser, G., ‘Rekursive Wort funk tionen’, Z. Math. Logik und Grundlagen der Mathematik 6 (1960), 258–278.

    Article  Google Scholar 

  • Belyakin, N. V., ‘Generalized Computability and Second Degree Arithmetic’, Algebra and Logic 9 (1970), 255–243.

    Article  Google Scholar 

  • Berger, R., ‘The Undecidability of the Domino Problem’, Memoirs Am. Math. Soc. 66 (1966), 72 pp.

    Google Scholar 

  • Boone, W. W., ‘Certain Simple Unsolvable Problems in Group Theory’, Proc. Kon. Nederl. Akad. A60 (1957), 22–27.

    Google Scholar 

  • Boone, W. W., Cannonito, F. B., and Lyndon, R. C., World Problems. Decision Problems and the Burnside Problem in Group Theory, North-Holland, Amsterdam, 1973, 658 pp.

    Google Scholar 

  • Brainerd, W. S. and Landweber, L. H., Theory of Computation, Wiley, New York, 1974, 357 pp.

    Google Scholar 

  • Church, A, A., ‘An Unsolvable Problem of Elementary Number Theory’, Am. J. Math. 58 (1936), 345–363. (Reprinted in Davis, 1965 ).

    Article  Google Scholar 

  • Church, A., ‘A Note on the Entscheidungsproblem’, J. Symbolic Logic 1 (1936), 40–41. Corr. ibid. pp. 101–102. (Included in Davis, 1965.)

    Google Scholar 

  • Cobham, A., ‘The Intrinsic Computational Difficulty of Functions’, in Y. Bar-Hillel (ed.), Logic, Methodology and Philosophy of Science, North-Holland, Amsterdam, 1965, pp. 24–30.

    Google Scholar 

  • Crossley, J. N. (ed.), ‘Reminiscenses of Logicians’, in Algebra and Logic, Lecture Notes No. 450, Springer, Heidelberg, 1975, pp. 1–62.

    Google Scholar 

  • Curry, H. B. and Feys, R., Combinatory Logic I, North-Holland, Amsterdam, 1968, 433 pp.

    Google Scholar 

  • Curry, H. B., Hindley, J. R., and Seldin, J. P., Combinatory Logic II, North-Holland, Amsterdam, 1972, 534 pp.

    Google Scholar 

  • Davis, M., Computability and Unsolvability, McGraw-Hill, New York, 1958, 235 pp.

    Google Scholar 

  • Davis M. (ed.), The Undecidable. Raven Press, Hewlett, N. Y., 1965, (Basic papers of the theory of recursive functions by Gödel, Church, Turing, Rosser, Kleene, Post, commented by the editor.) 440 pp.

    Google Scholar 

  • Davis, M., ‘Hilbert’s Tenth Problem is Unsolvable’, Am. Math. Monthly 80 (1973), 233–269.

    Article  Google Scholar 

  • Dehn,M., ‘ÜberunendlichediskontinuierlicheGmppen’,AfflrM. Ann. 71 (1912), 116-144.

    Google Scholar 

  • Dyck, W., ‘Gruppentheoretische Studien’, Math. Ann. 20 (1882), 1–44 (II. ibid. 22 (1883), 70–108.)

    Google Scholar 

  • Edmonds, J., ‘Paths, Trees, and Flowers’, Canadian J. Math. 17 (1965), 449–467.

    Article  Google Scholar 

  • Ershov, Yu. L., Lavrov, I. A., Taimanov,A. D.,andTaitslin,M. A., ‘Elementary Theories’, Russian Mathematical Surveys 20 (1965), 35–105.

    Article  Google Scholar 

  • Fenstad, J. E., ‘On Axiomatizing Recursion Theory’, in J. E. Fenstad and P. G. Hinman (eds.), Generalized Recursion Theory, North-Holland, Amsterdam, 1974, pp. 385–404.

    Chapter  Google Scholar 

  • Fenstad, J. E. and Hinman, P. G. (eds.), Generalized Recursion Theory, North-Holland, Amsterdam, 1974, 464 pp.

    Google Scholar 

  • Fitch, F.B., ‘Recursive Functions in Basic Logic’, J. Symbolic Logic 21 (1956), 337–346.

    Article  Google Scholar 

  • Friedberg, R. M., ‘Two Recursive Enumerable Sets of Incomparable Degrees of Unsolvability’, Proc. Nat. Acad. Sci. 43 (1957), 236–238.

    Article  Google Scholar 

  • Friedman, H. M., ‘Axiomatic Recursive Function Theory’, in R. O. Gandy and C. E. M. Yates (eds.), Logic Colloquium 69, North-Holland, Amsterdam, 1971, pp. 113–137.

    Chapter  Google Scholar 

  • Gandy, R. O. and Yates, C. E. M. (eds.), Logic Colloquium 69, North-Holland, Amsterdam, 1971, 465 pp.

    Google Scholar 

  • Gödel, K. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme Y, Monatsh. Math Phys. 38 (1931), 173–198.

    Article  Google Scholar 

  • Gödel, K., On Undecidable Propositions of Formal Mathematical Systems, Princeton, N.J., 1934, 30 pp. (Included in Davis, 1965, with a postscriptum by Gödel, 1964.)

    Google Scholar 

  • Gödel K., Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics 1946. (Included in Davis, 1965.)

    Google Scholar 

  • Grzegorczyk, A., ‘Some Classes of Recursive Functions’, Rozprawy mat. 4 (1953), 1–45.

    Google Scholar 

  • Hebeisen, F., ‘Charakterisierung der Aufzählungsreduzierbarkeit’, Achiv für math. Logik 18. (1977), 89–96.

    Google Scholar 

  • Herbrand, J. ‘Sur la non-contradiction de l’arithmetique’, J. reine angew. Math. 166 (1932), 1–8.

    Article  Google Scholar 

  • Hermes, H., ‘Ideen von Leibzin zur Grundlagenforschung: Die ars inveniendi und die ars iudicandi’, in Akten des internationalen Leibnizkongresses Hannover, 14. — 19.11.1966, III, Literatur und Zeitgescheben, Hannover, 1969, pp. 92–102.

    Google Scholar 

  • Hermes, H., ‘Entscheidungsprobleme und Dominospiele’, in K. Jacobs (ed.), Selecta Mathematica II, Springer, Heidelberg, 1970, pp. 114–140.

    Google Scholar 

  • Hermes, H., A Simplified Proof for the Unsolvability of the Decision Problem in the Case ∀∃∀ in R. O. Gandy and C. E. M. Yates (eds.), Logic Colloquium 69, North-Holland, Amsterdam, 1971, pp. 307–310.

    Chapter  Google Scholar 

  • Hopcroft, J. E. and Ullman, J. D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969, 250 pp.

    Google Scholar 

  • Kleene, S. C., ‘General Recursive Functions of Natural Numbers’, Math. Ann. 112 (1936), 727–742. (Reprinted in Davis, 1965.)

    Google Scholar 

  • Kleene, S. C., ‘On Notation of Ordinal Numbers’, J. Symbolic Logic 3 (1938), 150–155.

    Article  Google Scholar 

  • Kleene, S. C., ‘Recursive Predicates and Quantifiers’, Transactions Am. Math. Soc. 53 (1943), 41–73. (Reprinted in Davis, 1965.)

    Google Scholar 

  • Kleene, S. G., ‘Hierarchies of Number-Theoretic Predicates’, Bull. Am. Math. Soc. 61 (1955), 193–213.

    Article  Google Scholar 

  • Kleene, S. C. and Post, E. L., ‘The Upper Semi-Lattice of Degrees of Recursive Unsolvability’, Ann. Math. 59 (1954), 379–407.

    Article  Google Scholar 

  • Madison, F.W., ‘A Note on Computable Real Fields’, J. Symbolic Logic 35 (1970), 239–241.

    Article  Google Scholar 

  • Markov, A. A., ‘On the Impossibility of Certain Algorithms in the Theory of Associative Systems’, C. R. (Dokl.) Acad. Sci USSR (n. s.) 55 (1947), 583–586.

    Google Scholar 

  • Markov, A. A., Theory of Algorithms, The Israel Program for Sci. Transl., Jerusalem, 1962,444 pp. (Russ, original, 1954 ).

    Google Scholar 

  • Matijasevitč, J. V„ ‘Enumerable Sets are Diophantic’, Soviet Math. Dokl. 11 (1970), 345–357.

    Google Scholar 

  • Moschovakis, Y. N., ‘Axioms for Computing Theories — First Draft’, in R. O. Gandy and C. E.M. Yates (eds.), Logic Colloquium 69, North-Holland, Amsterdam, 1971, pp. 199–257.

    Chapter  Google Scholar 

  • Mostowski, A., Development and Applications of the ‘projective’ Classification of Sets of Integers, Proc. Intern. Congr. Math. Amsterdam, 1954, III. North-Holland, Amsterdam, 1956, pp. 280–288.

    Google Scholar 

  • Muchnik, A. A., ‘Negative Answers to the Problem of Reductibility of the Theory of Algorithms’, (In Russian.) Dokl Adad. Nauk SSSR 108 (1956), 194–197.

    Google Scholar 

  • Novikov, P. S., ‘On the Algorithmic Unsolvability of the Word Problem in Group Theory’, (Orig. Russ.) Am. Math. Soc. Transl. 9 (1958), 122 pp. (Original 1955.)

    Google Scholar 

  • Péter, R., Recursive Functions, Academic Press, New York, 1967. 300 pp.

    Google Scholar 

  • Péter, R., Rekursive Funktionen in der Komputer-Theorie, Akadémiai Kiadó, Budapest, 1976, 190 pp.

    Google Scholar 

  • Post, E. L., ‘Finite Combinatorial Processes. Formulation I’,/. Symbolic Logic 1 (1936), 103-105. (Reprinted in Davis, 1965.)

    Google Scholar 

  • Post, E. L., ‘Absolutely Unsolvable Problems and Relatively Undecidable Propositions’, Account of an anticipation, 1941. (First published in Davis, 1965.)

    Google Scholar 

  • Post, E. L., ‘Formal Reductions of the General Combinatorial Decision Problem’, Am. J. Math. 65 (1943), 197–215.

    Article  Google Scholar 

  • Post, E. L., ‘Recursively Enumerable Sets of Positive Integers and Their Decision Problems’, Bull. Am. Math. Soc. 50 (1944), 284–316 (Reprinted in Davis, 1965.)

    Google Scholar 

  • Post, E. L., ‘Recursive Unsolvability of a Problem of Thue’, J. Symbolic Logic 12 (1947), 1–11. (Reprinted in Davis, 1965.)

    Google Scholar 

  • Rabin, M. O., ‘Computable Algebra, General Theory and Theory of Computable Fields’, Trans. Am. Math. Soc. 95 (1960), 341–360.

    Google Scholar 

  • Robinson, R. M., ‘Undecidability and Nonperiodicity for Tilings of the Plane’, InventionesMath. 12 (1971), 177–209.

    Article  Google Scholar 

  • Rogers, Jr., H., Theory of Recursive Functions and Effective Computability, McGraw- Hill, New York, 1967, 501 pp.

    Google Scholar 

  • Rosser, J. B., ‘Extensions of Some Theorems of Gödel and Church’, J. Symbolic Logic 1 (1936), 87–91 (Reprinted in Davis, 1965.)

    Google Scholar 

  • Sacks, G. E., Degrees of Unsolvability, Univ. Press, Princeton, N.J., 1963, 180 pp.

    Google Scholar 

  • Sasso, Jr., J. P., ‘A Survey of Partial Degrees’, J. Symbolic Logic 40 (1975), 130–140.

    Article  Google Scholar 

  • Schnorr, C. P., Rekursive Funktionen und ihre Komplexität, Teubner, Stuttgart, 1974, 191 pp.

    Google Scholar 

  • Schoenfield, J. R., Degrees of Unsolvability, North-Holland, Amsterdam. 1971, 117 pp.

    Google Scholar 

  • Skordev, D., ‘Berechenbare und μ-rekursive Operatoren’, Bulgarska Akad. na Naukite Izvestija, Mat. Inst., Sofija 7 (1963), 5–43. (Bulg., with Russ. and German summary.)

    Google Scholar 

  • Specker, E. and Strassen, V. (ed.), Komplexität von Entscheidungsproblemen, Springer, Heidelberg, 1976, 217 pp.

    Google Scholar 

  • Strong, H., ‘Algebraically Generalized Recursive Function Theory’, IBM J. Research and Development 12 (1968), 465–475. (With a Bibliography.)

    Google Scholar 

  • Surányi, J., Reduktionstheorie des Entscheidungsproblems im Prädikatenkalkül der ersten Stufe, Ungar. Akad. der Wiss., Budapest, 1959, 216 pp.

    Google Scholar 

  • Thue, A., ‘Probleme der Veränderung von Zeichenreihen nach gegebenen Regeln’, Vid. Skrifter I. Mat.-Naturv. Klasse 10 (1914), 34 pp.

    Google Scholar 

  • Troelstra, A. S., ‘Metamathematical Investigations of Intuitionistic Arithmetic and Analysis’, Lecture Notes No. 344, Springer, Heidelberg, 1973, 502 pp.

    Book  Google Scholar 

  • Turing, A. M., ‘On Computable Numbers, with an Application to the Entscheidungs-problem’, Proc. London Math. Soc. (2) 42 (1936), 230–265. Corr. ibid. 43 (1937), 544–546. (Reprinted in Davis, 1965; compare the Appendix of Post, 1947.)

    Article  Google Scholar 

  • Turing, A. M., ‘Systems of Logic Based on Ordinals’, Proc. London Math. Soc. (2) 45 (1939), 161–228. (Reprinted in Davis, 1965.)

    Article  Google Scholar 

  • Wagner, E. G., ‘Uniform Reflexive Structures: On the Nature of Gödelizations and Relative Computability’, Trans. Am. Math. Soc. 144 (1969), 1–41.

    Google Scholar 

  • Wang, H., ‘Proving Theorems by Pattern Recognition II’ Bell Systems Technical Journal 40 (1961), 1–41.

    Google Scholar 

  • Wang, H.: ‘Remarks on Machines, Sets and the Decision Problem’, in J. N. Crossley and M. A. Dummett (eds.), Formal Systems and Recursive Functions, North-Holland, Amsterdam, 1965, pp. 304–319. (With a Bibliography.)

    Google Scholar 

  • Fenstad J.E., General Recursion Theory, Springer, Heidelberg, 1980,225 pp.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, Germany

    Hans Hermes

Authors
  1. Hans Hermes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Philosophy, University of Genoa, Italy

    Evandro Agazzi

Rights and permissions

Reprints and permissions

Copyright information

© 1981 D. Reidel Publishing Company

About this chapter

Cite this chapter

Hermes, H. (1981). Recursion Theory. In: Agazzi, E. (eds) Modern Logic — A Survey. Synthese Library, vol 149. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-9056-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-9056-2_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-9058-6

  • Online ISBN: 978-94-009-9056-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation