Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 902623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree |
scientific article; zbMATH DE number 902623 |
Statements
Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (English)
0 references
28 October 1996
0 references
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.
0 references
\(\text{nonlow}_ 2\) degree
0 references
lattice embedding
0 references
recursively enumerable degree
0 references
0.8474670052528381
0 references
0.8455531001091003
0 references
0.8441839814186096
0 references
0.8291702270507812
0 references
