Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
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.
scientific article; zbMATH DE number 902623
scientific article