The complexity of intrinsically R.e. Subsets of existentially decidable models

Journal of Symbolic Logic 55 (3):1213-1232 (1990)
  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: 99,596

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

Decidable subspaces and recursively enumerable subspaces.C. J. Ash & R. G. Downey - 1984 - Journal of Symbolic Logic 49 (4):1137-1145.
A complete, decidable theory with two decidable models.Terrence S. Millar - 1979 - Journal of Symbolic Logic 44 (3):307-312.
Indiscernibles and decidable models.H. A. Kierstead & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (1):21-32.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Decidable models of ω-stable theories.Uri Andrews - 2014 - Journal of Symbolic Logic 79 (1):186-192.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.

Analytics

Added to PP
2009-01-28

Downloads
25 (#815,593)

6 months
18 (#145,334)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Preface.J. N. Crossley - 1986 - Annals of Pure and Applied Logic 32 (C):111.

Add more references