Recursion theory on orderings. I. a model theoretic setting

Journal of Symbolic Logic 44 (3):383-402 (1979)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273131
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,631
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Donald A. Martin (1966). Classes of Recursively Enumerable Sets and Degrees of Unsolvability. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):295-310.
John Myhill (1955). Creative Sets. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (2):97-108.
John Myhill (1955). Creative Sets. Mathematical Logic Quarterly 1 (2):97-108.
J. B. Remmel (1978). Recursively Enumerable Boolean Algebras. Annals of Mathematical Logic 15 (1):75-107.

Add more references

Citations of this work BETA
John N. Crossley (1982). The Given. Studia Logica 41 (2-3):131 - 139.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #424,995 of 1,938,811 )

Recent downloads (6 months)

1 ( #458,338 of 1,938,811 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.