Lattice nonembeddings and initial segments of the recursively enumerable degrees
type: Item
instance of: scholarly article
title: Lattice nonembeddings and initial segments of the recursively enumerable degrees
zbMATH Open document ID: 0723.03025
DOI: 10.1016/0168-0072(90)90062-7
published in: Annals of Pure and Applied Logic
publication date: 1990-01-01T00:00:00Z
review text: The structure of an arbitrary initial segment of the upper semilattice of r.e. degrees is investigated. Main result: There exists a nonzero r.e. degree that bounds no critical triple. Conjecture: Every lattice that contains no critical triple is embeddable below every nonzero r.e. degree.
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 4191613
zbMATH Keywords: embedding
zbMATH Keywords: initial segment of the upper semilattice of r.e. degrees
zbMATH Keywords: critical triple
author: Rodney G. Downey
MaRDI profile type: Publication
full work available at URL: 0168-0072(90)90062-7
OpenAlex ID: W1980888823
cites work: Q5187269
cites work: Lattice embeddings into the recursively enumerable degrees. II
cites work: Intervals and sublattices of the r.e. weak truth table degrees. I: Density
cites work: Q3197813
cites work: Q3197814
cites work: The density of the nonbranching degrees
cites work: The undecidability of the recursively enumerable degrees
cites work: Q5670617
cites work: Bounding minimal pairs
cites work: A Refinement of Lown and Highn for the R.E. Degrees
cites work: Q3691658
cites work: Q4040892
Wikidata QID: Q127957228
description: scientific article; zbMATH DE number 4191613