Abstract
In this chapter we consider several ways in which number-theoretic functions and relations can be implicitly defined in number theories. We do not mean elementarily definable as in Chapter 11; the present notions of definability are expressed in terms of theories and not of structures. As we shall see, the notions lead to new equivalents of the notion of recursiveness; see 14.12, 14.20, and 14.26. They also form the basis for diagonalization procedures which produce many undecidable theories (see the next chapter). We shall be concerned with two types of implicit definability. The first, syntactic definability, follows; the second, spectral representability, is given in 14.22.
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.
Bibliography
Ershov, Yu., Lavrov, I., Taimanov, A., Taitslin, M., Elementary theories. Russian Mathematical Surveys, 20 (1965), 35–105.
Shoenfield, J., Mathematical Logic. Reading: Addison-Wesley (1967).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Implicit Definability in Number Theories. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_15
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9454-9
Online ISBN: 978-1-4684-9452-5
eBook Packages: Springer Book Archive