Skip to main content
SpringerLink
Log in

Strong constructivizability of homogeneous models

  • Published:
Algebra and Logic Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  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. Yu. L. Ershov, Theory of Enumerations [in Russian], Vol. 3, Novosibirsk (1974).

  3. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  4. C. C. Chang and H. J. Keisler, Model Theory, North-Holland, Amsterdam (1973).

    Google Scholar 

  5. T. Millar, "The theory of recursively presented models," Dissertation, Cornell University (1976).

  6. M. Morley, "Decidable models," Israel J. Math.,25, 233–240 (1976).

    Google Scholar 

  7. L. Harrington, "Recursively presentable prime models," J. Symb. Logic,39, 305–309 (1974).

    Google Scholar 

  8. M. G. Peretyat'kin, "A criterion for strong constructivizability of a homogeneous model," Algebra Logika,17, No. 4, 436–454 (1978).

    Google Scholar 

Download references

Authors
  1. S. S. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 17, No. 4, pp. 363–388, July–August, 1978.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goncharov, S.S. Strong constructivizability of homogeneous models. Algebra and Logic 17, 247–263 (1978). https://doi.org/10.1007/BF01674776

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01674776

Keywords

Search

Navigation