• Title of article

    A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees Original Research Article

  • Author/Authors

    M. Lerman، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    38
  • From page
    143
  • To page
    180
  • Abstract
    We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees.
  • Keywords
    Computably enumerable set , Priority method , Computably enumerable degree , Partial lattice , Embedding , Elementary theory
  • Journal title
    Annals of Pure and Applied Logic
  • Serial Year
    1998
  • Journal title
    Annals of Pure and Applied Logic
  • Record number

    896150

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=896150