Skip to main content
← Back to work

Works cited by this work

18 works

Work: Some properties of classes of minimal numberings of arithmetical set families

  1. Recursively Enumerable Sets and Degrees

    Robert I. Soare

    Book198710 citations
    ABI
  2. Theory of Numberings

    Yuri L. Ershov

    Chapter19996 citations
    ABI
  3. On decomposition of Gödelnumberings into Friedbergnumberings

    Britta Schinzel

    Article19824 citations
    ABI
  4. Rogers Semilattices of Families of Arithmetic Sets

    S. A. Badaev, С. С. Гончаров

    Article20012 citations
    ABI
  5. Computability and Numberings

    S. A. Badaev, С. С. Гончаров

    Chapter20072 citations
    ABI
  6. Local structure of Rogers semilattices of Σn 0-computable numberings

    S. Yu. Podzorov

    Article20052 citations
    ABI
  7. Some effectively infinite classes of enumerations

    С. С. Гончаров, Alexander Yakhnis, Vladimir Yakhnis

    Article19932 citations
    ABI
  8. A problem of S. S. Goncharov

    S. A. Badaev

    Article19912 citations
    ABI
  9. The enumeration spectrum hierarchy of <i>n</i>‐families

    M. Kh. Faĭzrahmanov, I. Sh. Kalimullin

    Article20162 citations
    ABI
  10. Minimal generalized computable enumerations and high degrees

    M. Kh. Faĭzrahmanov

    Article20172 citations
    ABI
  11. Khutoretskii’s Theorem for Generalized Computable Families

    M. Kh. Faĭzrakhmanov

    Article20192 citations
    ABI
  12. Complexity of Decompositions of Gödel Numberings

    Britta Schinzel

    Article19822 citations
    ABI
  13. Creative sets

    John Myhill

    Article19552 citations
    ABI
  14. Extremal numberings and fixed point theorems

    M. Kh. Faĭzrahmanov

    Article20222 citations
    ABI
  15. Fixed point theorems for minimal numberings

    M. Kh. Faĭzrahmanov

    Article20232 citations
    ABI