Vaught's theorem recursively revisited

Journal of Symbolic Logic 46 (2):397-411 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273632

Links

PhilArchive



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

External links

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 note on a theorem of Vaught.Joseph G. Rosenstein - 1971 - Journal of Symbolic Logic 36 (3):439-440.
Craig’s Theorem.Jeffrey Ketland - unknown
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
Back to basics: Revisiting the incompleteness theorems.Peter Smith - unknown
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
The classification of small weakly minimal sets. III: Modules.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (3):975-979.
Dual easy uniformization and model-theoretic descriptive set theory.Shaughan Lavine - 1991 - Journal of Symbolic Logic 56 (4):1290-1316.
An application of invariant sets to global definability.Douglas E. Miller - 1979 - Journal of Symbolic Logic 44 (1):9-14.

Analytics

Added to PP
2009-01-28

Downloads
16 (#906,812)

6 months
5 (#639,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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