Works matching DE "RECURSIVELY enumerable sets"


Results: 84
    1
    2
    3
    4

    One-sided random context grammars.

    Published in:
    Acta Informatica, 2011, v. 48, n. 3, p. 149, doi. 10.1007/s00236-011-0134-y
    By:
    • Meduna, Alexander;
    • Zemek, Petr
    Publication type:
    Article
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16

    ON A QUESTION OF KRAJEWSKI'S.

    Published in:
    Journal of Symbolic Logic, 2019, v. 84, n. 1, p. 343, doi. 10.1017/jsl.2018.72
    By:
    • PAKHOMOV, FEDOR;
    • VISSER, ALBERT
    Publication type:
    Article
    17

    ON THE NON-ENUMERABILITY OF L.

    Published in:
    Journal of Symbolic Logic, 2016, v. 81, n. 4, p. 1396, doi. 10.1017/jsl.2016.34
    By:
    • SACKS, G. E.
    Publication type:
    Article
    18
    19
    20
    21
    22

    Cupping ?20enumeration degrees to 0e??

    Published in:
    Mathematical Structures in Computer Science, 2009, v. 19, n. 1, p. 169, doi. 10.1017/S0960129508007378
    By:
    • MARIYA IVANOVA SOSKOVA;
    • GUOHUA WU
    Publication type:
    Article
    23
    24
    25
    26
    27
    28
    29

    A Splitting with Infimum in the d-c. e. Degrees.

    Published in:
    Mathematical Logic Quarterly, 2000, v. 46, n. 1, p. 53, doi. 10.1002/(SICI)1521-3870(200001)46:1<53::AID-MALQ53>3.0.CO;2-O
    By:
    • Hong, Lu;
    • Decheng, Ding;
    • Lei, Qian
    Publication type:
    Article
    30
    31
    32
    33
    34
    35
    36
    37

    Effective Nonrecursiveness.

    Published in:
    Mathematical Logic Quarterly, 1997, v. 43, n. 1, p. 45, doi. 10.1002/malq.19970430106
    By:
    • Yamaguchi, Takeshi
    Publication type:
    Article
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48

    System function languages.

    Published in:
    Mathematical Logic Quarterly, 1993, v. 39, n. 1, p. 357, doi. 10.1002/malq.19930390140
    By:
    • Thuraisingham, M. B.
    Publication type:
    Article
    49
    50