Adjoining cofinitary permutations

CSpace

	Adjoining cofinitary permutations
	Zhang, Y
	1999-12-01
发表期刊	JOURNAL OF SYMBOLIC LOGIC
ISSN	0022-4812
卷号	64 期号:4 页码:1803-1810
摘要	We show that it is consistent with ZFC + -CH that there is a maximal cofinitary group (or, maximal almost disjoint group) G less than or equal to Sym(omega) such that G is a proper subset of an almost disjoint Family A subset of or equal to sym(omega) and \ G \ < \ A \. We also ask several questions in this area.
语种	英语
WOS研究方向	Mathematics ; Science & Technology - Other Topics
WOS类目	Mathematics ; Logic
WOS记录号	WOS:000085131300029
出版者	ASSN SYMBOLIC LOGIC INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14310
专题	中国科学院数学与系统科学研究院
通讯作者	Zhang, Y
作者单位	1.Rutgers State Univ, Dept Math, New Brunswick, NJ 08903 USA 2.Acad Sinica, Inst Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Y. Adjoining cofinitary permutations[J]. JOURNAL OF SYMBOLIC LOGIC,1999,64(4):1803-1810.
APA	Zhang, Y.(1999).Adjoining cofinitary permutations.JOURNAL OF SYMBOLIC LOGIC,64(4),1803-1810.
MLA	Zhang, Y."Adjoining cofinitary permutations".JOURNAL OF SYMBOLIC LOGIC 64.4(1999):1803-1810.