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
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
Journal title :
Annals of Pure and Applied Logic
