Advertisement

Algebra and Logic

, Volume 17, Issue 4, pp 247–263 | Cite as

Strong constructivizability of homogeneous models

  • S. S. Goncharov
Article

Keywords

Mathematical Logic Homogeneous Model Strong Constructivizability 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete decidable theories," Algebra Logika,12, No. 2, 125–142 (1973).Google Scholar
  2. 2.
    Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. 3, Novosibirsk (1974).Google Scholar
  3. 3.
    H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).Google Scholar
  4. 4.
    C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam (1973).Google Scholar
  5. 5.
    T. Millar, "The theory of recursively presented models," Dissertation, Cornell University (1976).Google Scholar
  6. 6.
    M. Morley, "Decidable models," Israel J. Math.,25, 233–240 (1976).Google Scholar
  7. 7.
    L. Harrington, "Recursively presentable prime models," J. Symb. Logic,39, 305–309 (1974).Google Scholar
  8. 8.
    M. G. Peretyat'kin, "A criterion for strong constructivizability of a homogeneous model," Algebra Logika,17, No. 4, 436–454 (1978).Google Scholar

Copyright information

© Plenum Publishing Corporation 1979

Authors and Affiliations

  • S. S. Goncharov

There are no affiliations available

Personalised recommendations