Israel Journal of Mathematics

, Volume 25, Issue 3–4, pp 233–240 | Cite as

Decidable models

  • Michael Morley


A modelU is decidable if Th(U,a) a∈A is recursive. Various results about decidable models are discussed. A necessary and sufficient condition for there to be a decidable saturated model is given.


Decidable Model Prime Model Complete Theory Saturated Model Countable Model 
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.
    J. Barwise and J. Schipf,Recursively saturated and resplendent models, to appear in J. Symbolic Logic.Google Scholar
  2. 2.
    Leo Harrington,Recursively presented prime models, J. Symbolic Logic39 (1974), 305–309.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    T. Millar,The Theory of Recursively Presented Modules, Dissertation, Cornell University, 1976.Google Scholar
  4. 4.
    A. Peretyat’kin,On complete theories with a finite number of denumerable models, Algebra and Logic12 (1973), 310–326, translated from Algebra i Logika12 (1973), 550–576.zbMATHCrossRefGoogle Scholar
  5. 5.
    B. L. Vaught,Denumerable models of complete theories, Proc. Symp. on Foundations of Math. Infinitistic Methods, Warsaw, Pergamon Press, 1961, pp. 303–321.Google Scholar

Copyright information

© Hebrew University 1976

Authors and Affiliations

  • Michael Morley
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations