Definability of R. E. sets in a class of recursion theoretic structures

Journal of Symbolic Logic 48 (3):662-669 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

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

Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
Computational randomness and lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.
Computational Randomness and Lowness.Sebastiaan Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Selected logic papers.Gerald E. Sacks - 1999 - River Edge, N.J.: World Scientific.
Definability in well quasi-ordered sets of structures.Charles K. Landraitis - 1977 - Journal of Symbolic Logic 42 (2):289-291.

Analytics

Added to PP
2009-01-28

Downloads
40 (#387,310)

6 months
2 (#1,445,852)

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