TY - BOOK ED - Symposium in Pure Mathematics TI - Recursive function theory T2 - Proceedings of symposia in pure mathematics, SN - 9780821892909 (online) AV - QA248.5 .S9 1961 U1 - 517.5 PY - 1962/// CY - Providence PB - American Mathematical Society KW - American Mathematical Society KW - Recursive functions KW - Congresses N1 - "Sponsored by the American Mathematical Society, the Association for Computing Machinery, and the Association for Symbolic Logic."; Includes bibliographies; Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics; Clifford Spector --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0154801; Representability of sets in formal systems; Andrzej Mostowski --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142458; Herbrand-G�odel-style recursive functionals of finite types; S. C. Kleene --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0141594; Infinite series of isols; J. C. E. Dekker --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142447; $\Omega -\Lambda $; John Myhill --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142446; Arithmetically isolated and nonstandard models; A. Nerode --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0143698; Algebras of sets binumerable in complete extensions of arithmetic; Dana Scott --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0141595; Some problems in hierarchy theory; J. W. Addison --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0141599; The form of the negation of a predicate; J. R. Shoenfield --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142449; Applications of recursive function theory to number theory; Martin Davis --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0151380; Sequence generators and digital computers; A. W. Burks and J. B. Wright --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/9999; The treatment of ambiguity and paradox in mechanical languages; Saul Gorn --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142462; Computer programs for checking mathematical proofs; John McCarthy --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/9998; Size and structure of universal Turing machines using tag systems; M. L. Minsky --; http://www.ams.org/pspum/005; http://dx.doi.org/10.1090/pspum/005/0142452; Access is restricted to licensed institutions; Electronic reproduction; Providence, Rhode Island; American Mathematical Society; 2012 UR - http://www.ams.org/pspum/005 UR - http://dx.doi.org/10.1090/pspum/005 ER -