A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees

Annals of Pure and Applied Logic 94 (1-3):143-180 (1998)
  Copy   BIBTEX

Abstract

We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,593

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

Homomorphisms and quotients of degree structures.Burkhard Englert, Manuel Lerman & Kevin Wald - 2003 - Annals of Pure and Applied Logic 123 (1-3):193-233.
Embeddings of N5 and the contiguous degrees.Klaus Ambos-Spies & Peter A. Fejer - 2001 - Annals of Pure and Applied Logic 112 (2-3):151-188.

Analytics

Added to PP
2014-01-16

Downloads
19 (#810,414)

6 months
3 (#1,256,727)

Historical graph of downloads
How can I increase my downloads?

Author's Profile