COMPLEMENTING BELOW RECURSIVELY-ENUMERABLE DEGREES

被引：7

|

作者：

COOPER, SB ^{[1
]}

EPSTEIN, RL ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,DEPT PHILOSOPHY,BERKELEY,CA 94720

来源：

ANNALS OF PURE AND APPLIED LOGIC | 1987年 / 34卷 / 01期

关键词：

D O I：

10.1016/0168-0072(87)90039-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：15 / 32

页数：18

相关论文

共 50 条

[41] THE ELEMENTARY THEORY OF THE RECURSIVELY-ENUMERABLE DEGREES IS NOT ALEPH-0-CATEGORICAL
LERMAN, M
SHORE, RA
SOARE, RI
ADVANCES IN MATHEMATICS, 1984, 53 (03) : 301 - 320
[42] EMBEDDING THE DIAMOND LATTICE IN THE RECURSIVELY-ENUMERABLE TRUTH-TABLE DEGREES
JOCKUSCH, CG
MOHRHERR, J
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1985, 94 (01) : 123 - 128
[43] FRIEDBERG SPLITTINGS OF RECURSIVELY-ENUMERABLE SETS
DOWNEY, R
STOB, M
ANNALS OF PURE AND APPLIED LOGIC, 1993, 59 (03) : 175 - 199
[44] ON THE COMPLEXITY OF SEPARATION OF RECURSIVELY-ENUMERABLE SETS
KANOVICH, MI
DOKLADY AKADEMII NAUK SSSR, 1982, 267 (06): : 1300 - 1304
[45] RECURSIVELY-ENUMERABLE L-SETS
BIACINO, L
GERLA, G
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1987, 33 (02): : 107 - 113
[46] THE THEORY OF THE RECURSIVELY-ENUMERABLE WEAK TRUTH-TABLE DEGREES IS UNDECIDABLE
AMBOSSPIES, K
NIES, A
SHORE, RA
JOURNAL OF SYMBOLIC LOGIC, 1992, 57 (03) : 864 - 874
[47] PAIRS WITHOUT INFIMUM IN THE RECURSIVELY-ENUMERABLE WEAK TRUTH TABLE DEGREES
FISCHER, P
JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (01) : 117 - 129
[48] RECURSIVELY-ENUMERABLE EQUIVALENCE-RELATIONS
CARROLL, JS
JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (01) : 285 - 285
[49] DECIDABLE SUBSPACES AND RECURSIVELY-ENUMERABLE SUBSPACES
ASH, CJ
DOWNEY, RG
JOURNAL OF SYMBOLIC LOGIC, 1984, 49 (04) : 1137 - 1145
[50] COMPLETE, RECURSIVELY-ENUMERABLE RELATIONS IN ARITHMETIC
DAGOSTINO, G
MAGNAGO, M
MATHEMATICAL LOGIC QUARTERLY, 1995, 41 (01) : 65 - 72

← 1 2 3 4 5 →