Title of article :
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
Original Research Article
Author/Authors :
Burkhard Englert، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
We present a necessary and sufficient condition for the embeddability of a finite principally decomposable lattice into the computably enumerable degrees preserving greatest element.
Keywords :
Elementary theory , Computably enumerable degree , Computably enumerable set , Embedding , Priority method , Lattice
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic
