A complete, decidable theory with two decidable models

Journal of Symbolic Logic 44 (3):307-312 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,053

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.
Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
The degree spectra of homogeneous models.Karen Lange - 2008 - Journal of Symbolic Logic 73 (3):1009-1028.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.
The completeness of S.Harry Deutsch - 1979 - Studia Logica 38 (2):137 - 147.
Indiscernibles and decidable models.H. A. Kierstead & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (1):21-32.
Decidable models of ω-stable theories.Uri Andrews - 2014 - Journal of Symbolic Logic 79 (1):186-192.

Analytics

Added to PP
2009-01-28

Downloads
41 (#524,453)

6 months
11 (#303,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

WKL 0 and induction principles in model theory.David R. Belanger - 2015 - Annals of Pure and Applied Logic 166 (7-8):767-799.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.

Add more references