Stable Ordered Union Ultrafilters and cov(M) < c

David José Fernández-Bretón

doi:10.1017/jsl.2019.20

Stable Ordered Union Ultrafilters and cov(M) < c

David José Fernández-Bretón

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A union ultrafilter is an ultrafilter over the finite subsets of ω that has a base of sets of the form , where X is an infinite pairwise disjoint family and FU(X) = {∪ F|F [X]^<ω\{ø}}. The existence of these ultrafilters is not provable from the axioms, but is known to follow from the assumption that cov(M) = c. In this article we obtain various models of that satisfy the existence of union ultrafilters while at the same time cov(M) < c.

Original language	English
Pages (from-to)	1176-1193
Number of pages	18
Journal	Journal of Symbolic Logic
Volume	84
Issue number	3
DOIs	https://doi.org/10.1017/jsl.2019.20
State	Published - 1 Sep 2019
Externally published	Yes

Keywords

Hindman's theorem
cardinal characteristics of the continuum
iterated forcing
proper forcing
ultrafilters

Access to Document

10.1017/jsl.2019.20

Cite this

@article{9b26206e76e54b3c8b5a8ecd3320519c,

title = "Stable Ordered Union Ultrafilters and cov(M) < c",

abstract = "A union ultrafilter is an ultrafilter over the finite subsets of ω that has a base of sets of the form , where X is an infinite pairwise disjoint family and FU(X) = {∪ F|F [X]<ω\{{\o}}}. The existence of these ultrafilters is not provable from the axioms, but is known to follow from the assumption that cov(M) = c. In this article we obtain various models of that satisfy the existence of union ultrafilters while at the same time cov(M) < c.",

keywords = "Hindman's theorem, cardinal characteristics of the continuum, iterated forcing, proper forcing, ultrafilters",

author = "Fern{\'a}ndez-Bret{\'o}n, {David Jos{\'e}}",

note = "Publisher Copyright: {\textcopyright} 2019 The Association for Symbolic Logic.",

year = "2019",

month = sep,

day = "1",

doi = "10.1017/jsl.2019.20",

language = "Ingl{\'e}s",

volume = "84",

pages = "1176--1193",

journal = "Journal of Symbolic Logic",

issn = "0022-4812",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - Stable Ordered Union Ultrafilters and cov(M) < c

AU - Fernández-Bretón, David José

PY - 2019/9/1

Y1 - 2019/9/1

N2 - A union ultrafilter is an ultrafilter over the finite subsets of ω that has a base of sets of the form , where X is an infinite pairwise disjoint family and FU(X) = {∪ F|F [X]<ω\{ø}}. The existence of these ultrafilters is not provable from the axioms, but is known to follow from the assumption that cov(M) = c. In this article we obtain various models of that satisfy the existence of union ultrafilters while at the same time cov(M) < c.

AB - A union ultrafilter is an ultrafilter over the finite subsets of ω that has a base of sets of the form , where X is an infinite pairwise disjoint family and FU(X) = {∪ F|F [X]<ω\{ø}}. The existence of these ultrafilters is not provable from the axioms, but is known to follow from the assumption that cov(M) = c. In this article we obtain various models of that satisfy the existence of union ultrafilters while at the same time cov(M) < c.

KW - Hindman's theorem

KW - cardinal characteristics of the continuum

KW - iterated forcing

KW - proper forcing

KW - ultrafilters

UR - http://www.scopus.com/inward/record.url?scp=85072330092&partnerID=8YFLogxK

U2 - 10.1017/jsl.2019.20

DO - 10.1017/jsl.2019.20

M3 - Artículo

AN - SCOPUS:85072330092

SN - 0022-4812

VL - 84

SP - 1176

EP - 1193

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

IS - 3

ER -

Stable Ordered Union Ultrafilters and cov(M) < c

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this