Title of article
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees Original Research Article
Author/Authors
Steffen Lempp ، نويسنده , , Manuel Lerman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
19
From page
167
To page
185
Abstract
We exhibit a finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Our method promises to lead to a full characterization of the finite lattices embeddable into the enumerable Turing degrees.
Keywords
(recursively) Enumerable degrees , Critical triple , Decidability , ?2-theory , Lattice embeddings
Journal title
Annals of Pure and Applied Logic
Serial Year
1997
Journal title
Annals of Pure and Applied Logic
Record number
890142
Link To Document