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)

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
7 (#1,380,763)

6 months
3 (#962,966)

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