Review: Leo Harrington, Recursively Presentable Prime Models; Terrence S. Millar, Foundations of Recursive Model Theory; Terrence S. Millar, A Complete, Decidable Theory with Two Decidable Models [Book Review]

Journal of Symbolic Logic 49 (2):671-672 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A complete, decidable theory with two decidable models.Terrence S. Millar - 1979 - Journal of Symbolic Logic 44 (3):307-312.
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.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
A new spectrum of recursive models using an amalgamation construction.Uri Andrews - 2011 - Journal of Symbolic Logic 76 (3):883 - 896.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
Prime models and almost decidability.Terrence Millar - 1986 - Journal of Symbolic Logic 51 (2):412-420.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
Finite extensions and the number of countable models.Terrence Millar - 1989 - Journal of Symbolic Logic 54 (1):264-270.
Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.
Review: A. H. Lachlan, Patrick Suppes, On the Number of Countable Models of a Countable Superstable Theory; Daniel Lascar, Ranks and Definability in Superstable Theories. [REVIEW]Terrence Millar - 1982 - Journal of Symbolic Logic 47 (1):215-217.
Vaught's theorem recursively revisited.Terrence Millar - 1981 - Journal of Symbolic Logic 46 (2):397-411.
Recursive categoricity and persistence.Terrence Millar - 1986 - Journal of Symbolic Logic 51 (2):430-434.
Review: David Marker, J. Stern, Degrees of Models of True Arithmetic; Julia Knight, Alistair H. Lachlan, Robert I. Soare, Two Theorems on Degrees of Models of True Arithmetic. [REVIEW]Terrence S. Millar - 1987 - Journal of Symbolic Logic 52 (2):562-563.

Analytics

Added to PP
2013-11-22

Downloads
3 (#1,690,426)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references