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. The Lambda Calculus: Its Syntax and Semantics, North Holland, Amsterdam, 1981.
Barendregt, H.P. Lambda calculus with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, (Eds), Handbook of Logic in Computer Science, pp. 118–310, Oxford University Press, Oxford, 1992.
Barwise, J. Admissible Sets and Structures. Springer-Verlag, Berlin. 1975.
Cutland, N. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge, 1990.
Drake, F.R., and Wainer, S.J. Eds. Recursion Theory and Its Generalizations. London Mathematical Society Lecture Notes Series, no. 45, Cambridge University Press, Cambridge, 1980.
Ershov, Y.L. Definability and Computability. Nauka, Novosibirsk, 1996.
Havel, P. Metamathematics of First Order Arithmetic. Springer-Verlag, New York, 1991
Montague, R. Recursion theory as a branch of model theory. In: B. van Roostelaar et al. Ed., Logic, Methodogology and Philosophy of Science III. Proc. of the 1967 Congress., pp 63–86. North-Holland, Amsterdam, 1968.
Rogers, H. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967; 1988.
Smorynski, C. Logical Number Theory I: An Introduction. Springer-Verlag, Berlin, 1991.
Tucker, J.V. , and Bergstra, J.A. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras, ACM, Volume 42, 1194–1230, 1995.
Tucker, J. V. and Stoltenberg-Hansen, V. Effective algebras. In: S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, (Eds), Handbook of Logic in Computer Science. Vol. 4. pp. 357–526, Oxford University Press, Oxford, 1995.
Tucker, J.V. and Stoltenberg-Hansen, V. Computable rings and fields, in E Griffor (Ed.), Handbook of Computability Theory, pp. 363–447. Elsevier, Amsterdam, 1999.
Tucker, J. V. and Zucker, J. I.Computable functions and semicomputable sets on many sorted algebras. In: S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, (Eds), Handbook of Logic in Computer Science. Vol. 5, pp. 317–523. Oxford University Press, Oxford, 2000.
Tucker. J.V. Zucker, J.I. Abstract computability and algebraic specification. ACM Trans. on Comput. Logic. 5: 611–668, 2004.
Turing, A.M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Math. Soc., 42(2), 230–265; correction ibid. 43, 544–546 (1937).
Turing, A.M., Computability and Lambda-Definability, J. of Symbol. Log, 2, 1937.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Turner, R. (2009). Definability. In: Computable Models. Springer, London. https://doi.org/10.1007/978-1-84882-052-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-84882-052-4_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-051-7
Online ISBN: 978-1-84882-052-4
eBook Packages: Computer ScienceComputer Science (R0)