Many simple cardinal invariants

Martin Goldstern; Saharon Shelah

doi:10.1007/BF01375552

Many simple cardinal invariants

Martin Goldstern, Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

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

34 Scopus citations

Abstract

For g<f in ω^ω we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force א₁ many different values for different functions (f,g). In the language of [B1]: There may be א₁ many distinct uniform II₁¹ characteristics.

Original language	English
Pages (from-to)	203-221
Number of pages	19
Journal	Archive for Mathematical Logic
Volume	32
Issue number	3
DOIs	https://doi.org/10.1007/BF01375552
State	Published - May 1993

Access to Document

10.1007/BF01375552

Cite this

@article{f34a871189534750a885e62d5df0bcd7,

title = "Many simple cardinal invariants",

abstract = "For gω we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force א1 many different values for different functions (f,g). In the language of [B1]: There may be א1 many distinct uniform II11 characteristics.",

author = "Martin Goldstern and Saharon Shelah",

year = "1993",

month = may,

doi = "10.1007/BF01375552",

language = "אנגלית",

volume = "32",

pages = "203--221",

journal = "Archive for Mathematical Logic",

issn = "0933-5846",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Many simple cardinal invariants

AU - Goldstern, Martin

AU - Shelah, Saharon

PY - 1993/5

Y1 - 1993/5

N2 - For gω we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force א1 many different values for different functions (f,g). In the language of [B1]: There may be א1 many distinct uniform II11 characteristics.

AB - For gω we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force א1 many different values for different functions (f,g). In the language of [B1]: There may be א1 many distinct uniform II11 characteristics.

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

U2 - 10.1007/BF01375552

DO - 10.1007/BF01375552

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

AN - SCOPUS:0003148259

SN - 0933-5846

VL - 32

SP - 203

EP - 221

JO - Archive for Mathematical Logic

JF - Archive for Mathematical Logic

IS - 3

ER -

Many simple cardinal invariants

Abstract

Access to Document

Other files and links

Fingerprint

Cite this