Atomless r-maximal sets

被引：4

作者：

Cholak, PA ^{[1
]}

Nies, A

机构：

[1] Univ Notre Dame, Dept Math, Notre Dame, IN 46556 USA

[2] Univ Chicago, Dept Math, Chicago, IL 60637 USA

来源：

ISRAEL JOURNAL OF MATHEMATICS | 1999年 / 113卷 / 1期

关键词：

D O I：

10.1007/BF02780182

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation, where A is an atomless r-maximal set. We answer a long-standing question by showing that there are infinitely many pairwise non-isomorphic filters of this type.

引用

页码：305 / 322

页数：18

共 10 条

[1] Cholak P. A., 1995, MEMOIRS AM MATH SOC, V113
[2] AUTOMORPHISMS OF THE LATTICE OF RECURSIVELY-ENUMERABLE SETS - ORBITS
DOWNEY, RG
STOB, M
[J]. ADVANCES IN MATHEMATICS, 1992, 92 (02) : 237 - 265
[3] HARRINGTON L, IN PRESS ADV MATH
[4] ON LATTICE OF RECURSIVELY ENUMERABLE SETS
LACHLAN, AH
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1968, 130 (01) : 1 - &
[5] DECIDABLE FRAGMENT OF THE ELEMENTARY THEORY OF THE LATTICE OF RECURSIVELY-ENUMERABLE SETS
LERMAN, M
SOARE, RI
[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1980, 257 (01) : 1 - 37
[6] THE INTERVALS OF THE LATTICE OF RECURSIVELY-ENUMERABLE SETS DETERMINED BY MAJOR SUBSETS
MAASS, W
STOB, M
[J]. ANNALS OF PURE AND APPLIED LOGIC, 1983, 24 (02) : 189 - 212
[7] SIMPLICITY OF RECURSIVELY ENUMERABLE SETS
ROBINSON, RW
[J]. JOURNAL OF SYMBOLIC LOGIC, 1967, 32 (02) : 162 - &
[8] Soare R., 1987, PERSPECTIVES MATH LO
[9] AUTOMORPHISMS OF THE LATTICE OF RECURSIVELY-ENUMERABLE SETS .2. LOW SETS
SOARE, RI
[J]. ANNALS OF MATHEMATICAL LOGIC, 1982, 22 (01): : 69 - 108
[10] AUTOMORPHISMS OF LATTICE OF RECURSIVELY ENUMERABLE SETS .1. MAXIMAL SETS
SOARE, RI
[J]. ANNALS OF MATHEMATICS, 1974, 100 (01) : 80 - 120

← 1 →