CSpace
Adjoining cofinitary permutations
Zhang, Y
1999-12-01
Source PublicationJOURNAL OF SYMBOLIC LOGIC
ISSN0022-4812
Volume64Issue:4Pages:1803-1810
AbstractWe 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.
Language英语
WOS Research AreaMathematics ; Science & Technology - Other Topics
WOS SubjectMathematics ; Logic
WOS IDWOS:000085131300029
PublisherASSN SYMBOLIC LOGIC INC
Citation statistics
Cited Times:4[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/14310
Collection中国科学院数学与系统科学研究院
Affiliation1.Rutgers State Univ, Dept Math, New Brunswick, NJ 08903 USA
2.Acad Sinica, Inst Math, Beijing 100080, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang, Y]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang, Y]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang, Y]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.