Embedding finite lattices into the σ02 enumeration degrees

Journal of Symbolic Logic 67 (1):69 - 90 (2002)
We show that every finite lattice is embeddable into the Σ 0 2 enumeration degrees via a lattice-theoretic embedding which preserves 0 and 1
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150030
 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: 24,470
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
S. K. Thomason (1971). Sublattices of the Recursively Enumerable Degrees. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1):273-280.
S. Barry Cooper (1987). Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

9 ( #439,856 of 1,925,550 )

Recent downloads (6 months)

1 ( #418,152 of 1,925,550 )

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.