Homomorphisms and quotients of degree structures

Annals of Pure and Applied Logic 123 (1-3):193-233 (2003)
  Copy   BIBTEX

Abstract

We investigate homomorphisms of degree structures with various relations, functions and constants. Our main emphasis is on pseudolattices, i.e., partially ordered sets with a join operation and relations simulating the meet operation. We show that there are no finite quotients of the pseudolattice of degrees or of the pseudolattice of degrees 0′, but that many finite distributive lattices are pseudolattice quotients of the pseudolattice of computably enumerable degrees

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

Automatic continuity of group homomorphisms.Christian Rosendal - 2009 - Bulletin of Symbolic Logic 15 (2):184-214.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
Continuum-Many Boolean Algebras of the Form [image] Borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
Automatic structures of bounded degree revisited.Dietrich Kuske & Markus Lohrey - 2011 - Journal of Symbolic Logic 76 (4):1352-1380.

Analytics

Added to PP
2014-01-16

Downloads
18 (#836,872)

6 months
9 (#317,143)

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

Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.

Add more references