On complete theories with a finite number of denumerable models

M. G. Peretyat'kin

doi:10.1007/bf02218589

journal article Sep 01, 1973

On complete theories with a finite number of denumerable models

M. G. Peretyat'kin

Algebra and Logic Vol. 12 No. 5 pp. 310-326 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02218589

Topics

No keywords indexed for this article. Browse by subject →

References

6

[1]

S. S. Goncharov and A. T. Nurtazin, "Constructive models of complete solvable theories," Algebra i Logika,12, No. 2, 125–142 (1973). 10.1007/bf02219289

[2]

Yu. L. Ershov, "Constructive models," in: Selected Topics in Algebra and Mathematical Logic, Novosibirsk (1972).

[3]

A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka (1970).

[4]

A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).

[5]

M. G. Peretyat'kin, "Strongly constructive models and enumerations of a Boolean algebra of recursive sets," Algebra i Logika,10, No. 5, 535–557 (1971). 10.1007/bf02219840

[6]

R. L. Vaught, "Denumerable models of complete theories, Infinistic methods," Proc. Symp. Found. Math., Warsaw (1959).

Metrics

24

Citations

6

References

Details

Published: Sep 01, 1973
Vol/Issue: 12(5)
Pages: 310-326
License: View

Authors

M

M. G. Peretyat'kin

Cite This Article

M. G. Peretyat'kin (1973). On complete theories with a finite number of denumerable models. Algebra and Logic, 12(5), 310-326. https://doi.org/10.1007/bf02218589

On complete theories with a finite number of denumerable models

You May Also Like