LATTICE EMBEDDINGS INTO THE RECURSIVELY-ENUMERABLE DEGREES .2.

被引：13

作者：

AMBOSSPIES, K

LERMAN, M

机构：

[1] UNIV DORTMUND,LEHRSTUHL INFORMAT 2,D-4600 DORTMUND 50,FED REP GER

[2] UNIV CONNECTICUT,DEPT MATH,STORRS,CT 06269

来源：

JOURNAL OF SYMBOLIC LOGIC | 1989年 / 54卷 / 03期

关键词：

D O I：

10.2307/2274738

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：735 / 760

页数：26

共 50 条

[31] DISCONTINUITY OF CAPPINGS IN THE RECURSIVELY-ENUMERABLE DEGREES AND STRONGLY NONBRANCHING DEGREES
AMBOSSPIES, K
DING, DC
MATHEMATICAL LOGIC QUARTERLY, 1994, 40 (03) : 287 - 317
[32] THE QUOTIENT SEMILATTICE OF THE RECURSIVELY-ENUMERABLE DEGREES MODULO THE CAPPABLE DEGREES
SCHWARZ, S
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 283 (01) : 315 - 328
[33] T-DEGREES OF DIFFERENCES OF RECURSIVELY-ENUMERABLE SETS
BUKHAREV, NR
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1981, (05): : 40 - 49
[34] UNDECIDABILITY AND 1-TYPES IN THE RECURSIVELY-ENUMERABLE DEGREES
AMBOSSPIES, K
SHORE, RA
ANNALS OF PURE AND APPLIED LOGIC, 1993, 63 (01) : 3 - 37
[35] Lattice embeddings below a nonlow(2) recursively enumerable degree
Downey, R
Shore, RA
ISRAEL JOURNAL OF MATHEMATICS, 1996, 94 : 221 - 246
[36] A CLASS OF RECURSIVELY-ENUMERABLE SETS
MOROZOV, AS
SIBERIAN MATHEMATICAL JOURNAL, 1987, 28 (02) : 278 - 282
[37] CHARACTERIZATION OF RECURSIVELY-ENUMERABLE SETS WITH SUPERSETS EFFECTIVELY ISOMORPHIC TO ALL RECURSIVELY-ENUMERABLE SETS
MAASS, W
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1983, 279 (01) : 311 - 336
[38] GENERICITY FOR RECURSIVELY-ENUMERABLE SETS
JOCKUSCH, CG
LECTURE NOTES IN MATHEMATICS, 1985, 1141 : 203 - 232
[39] DIFFERENCES OF RECURSIVELY-ENUMERABLE SETS
ISHMUKHAMETOV, ST
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1985, (08): : 3 - 12
[40] ON CHARACTERIZATIONS OF RECURSIVELY-ENUMERABLE LANGUAGES
LATTEUX, M
TURAKAINEN, P
ACTA INFORMATICA, 1990, 28 (02) : 179 - 186

← 1 2 3 4 5 →