Ramsey ultrafilters and the reaping number-con(r<u)

M. Goldstern; S. Shelah

doi:10.1016/0168-0072(90)90063-8

Ramsey ultrafilters and the reaping number-con(r<u)

M. Goldstern^*, S. Shelah

^*Corresponding author for this work

Einstein Institute of Mathematics

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

19 Scopus citations

Abstract

We show that it is consistent that the reaping number ris less than u, the size of the smallest base for an ultrafilter. To show that our forcing preserves certain ultrafilters, we prove a general partition theorem involving Ramsey ideals.

Original language	English
Pages (from-to)	121-142
Number of pages	22
Journal	Annals of Pure and Applied Logic
Volume	49
Issue number	2
DOIs	https://doi.org/10.1016/0168-0072(90)90063-8
State	Published - 12 Oct 1990

Access to Document

10.1016/0168-0072(90)90063-8

Cite this

@article{5cde2152e0c54b668e2e112ebb16f085,

title = "Ramsey ultrafilters and the reaping number-con(r<u)",

abstract = "We show that it is consistent that the reaping number ris less than u, the size of the smallest base for an ultrafilter. To show that our forcing preserves certain ultrafilters, we prove a general partition theorem involving Ramsey ideals.",

author = "M. Goldstern and S. Shelah",

year = "1990",

month = oct,

day = "12",

doi = "10.1016/0168-0072(90)90063-8",

language = "אנגלית",

volume = "49",

pages = "121--142",

journal = "Annals of Pure and Applied Logic",

issn = "0168-0072",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Ramsey ultrafilters and the reaping number-con(r<u)

AU - Goldstern, M.

AU - Shelah, S.

PY - 1990/10/12

Y1 - 1990/10/12

N2 - We show that it is consistent that the reaping number ris less than u, the size of the smallest base for an ultrafilter. To show that our forcing preserves certain ultrafilters, we prove a general partition theorem involving Ramsey ideals.

AB - We show that it is consistent that the reaping number ris less than u, the size of the smallest base for an ultrafilter. To show that our forcing preserves certain ultrafilters, we prove a general partition theorem involving Ramsey ideals.

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

U2 - 10.1016/0168-0072(90)90063-8

DO - 10.1016/0168-0072(90)90063-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0040340657

SN - 0168-0072

VL - 49

SP - 121

EP - 142

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

IS - 2

ER -

Ramsey ultrafilters and the reaping number-con(r<u)

Abstract

Access to Document

Other files and links

Fingerprint

Cite this