Implicit Definability in Number Theories

  • J. Donald Monk
Part of the Graduate Texts in Mathematics book series (GTM, volume 37)


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.


Number Theory Recursive Function Relation Symbol Finite Model Operation Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ershov, Yu., Lavrov, I., Taimanov, A., Taitslin, M., Elementary theories. Russian Mathematical Surveys, 20 (1965), 35–105.CrossRefGoogle Scholar
  2. 2.
    Shoenfield, J., Mathematical Logic. Reading: Addison-Wesley (1967).MATHGoogle Scholar

Copyright information

© Springer-Verlag Inc. 1976

Authors and Affiliations

  • J. Donald Monk
    • 1
  1. 1.Department of MathematicsUniversity of ColoradoBoulderUSA

Personalised recommendations