Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
type: Item
instance of: scholarly article
title: Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
zbMATH Open document ID: 0849.03030
DOI: 10.1007/BF02762706
author: Richard A. Shore
author: Rodney G. Downey
published in: Israel Journal of Mathematics
publication date: 1996-10-28T00:00:00Z
review text: The paper introduces a new technique to show that the lattice \(M_5\) is embeddable below any \(\text{nonlow}_2\) recursively enumerable degree. Furthermore the authors propose the following ``\(\text{Nonlow}_2\) Embedding Conjecture'' that, if \(L\) is embeddable into \(R\), then \(L\) is embeddable below an arbitrary \(\text{nonlow}_2\) r.e. degree.
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 902623
zbMATH Keywords: \(\text{nonlow}_ 2\) degree
zbMATH Keywords: lattice embedding
zbMATH Keywords: recursively enumerable degree
reviewed by: Xizhong Zheng
MaRDI profile type: Publication
cites work: Q4764099
cites work: Degree theoretical splitting properties of recursively enumerable sets
cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
cites work: Lattice embeddings into the recursively enumerable degrees
cites work: Lattice embeddings into the recursively enumerable degrees. II
cites work: Lattice nonembeddings and intervals of the recursively enumerable degrees
cites work: Minimal pairs and high recursively enumerable degrees
cites work: Q3197813
cites work: Array nonrecursive degrees and lattice embeddings of the diamond
cites work: Lattice nonembeddings and initial segments of the recursively enumerable degrees
cites work: Highness and bounding minimal pairs
cites work: Q3197814
cites work: Degree theoretic definitions of the low2 recursively enumerable sets
cites work: Completely mitotic r. e. degrees
cites work: Structural interactions of the recursively enumerable T- and W-degrees
cites work: Splitting theorems in recursion theory
cites work: Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
cites work: Degrees of members of \(\Pi_ 1^ 0\) classes
cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees
cites work: Q5670617
cites work: Bounding minimal pairs
cites work: Not every finite lattice is embeddable in the recursively enumerable degrees
cites work: Mitotic recursively enumerable sets
cites work: A Completely Mitotic Nonrecursive R.E. Degree
cites work: The weak truth table degrees of recursively enumerable sets
cites work: Q4044555
cites work: Q3712325
cites work: Axiomatizable theories with few axiomatizable extensions
cites work: On the degrees less than 0'
cites work: Q5586291
cites work: Working below a \(low_ 2\) recursively enumerable degree
cites work: Working below a high recursively enumerable degree
cites work: The density of infima in the recursively enumerable degrees
cites work: Q3819052
cites work: Sublattices of the Recursively Enumerable Degrees
cites work: A minimal pair of recursively enumerable degrees
description: scientific article; zbMATH DE number 902623