Applications of pcf theory

Saharon Shelah

doi:10.2307/2695067

Applications of pcf theory

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

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

25 Scopus citations

Abstract

We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further T_D(f). The sections can be read independently, although there are some minor dependencies.

Original language	English
Pages (from-to)	1624-1674
Number of pages	51
Journal	Journal of Symbolic Logic
Volume	65
Issue number	4
DOIs	https://doi.org/10.2307/2695067
State	Published - Dec 2000

Access to Document

10.2307/2695067

Cite this

@article{b5febdb9b75d46b994dc5ae7e356efa7,

title = "Applications of pcf theory",

abstract = "We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further TD(f). The sections can be read independently, although there are some minor dependencies.",

author = "Saharon Shelah",

year = "2000",

month = dec,

doi = "10.2307/2695067",

language = "אנגלית",

volume = "65",

pages = "1624--1674",

journal = "Journal of Symbolic Logic",

issn = "0022-4812",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - Applications of pcf theory

AU - Shelah, Saharon

PY - 2000/12

Y1 - 2000/12

N2 - We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further TD(f). The sections can be read independently, although there are some minor dependencies.

AB - We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further TD(f). The sections can be read independently, although there are some minor dependencies.

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

U2 - 10.2307/2695067

DO - 10.2307/2695067

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

AN - SCOPUS:0034559625

SN - 0022-4812

VL - 65

SP - 1624

EP - 1674

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

IS - 4

ER -

Applications of pcf theory

Abstract

Access to Document

Other files and links

Fingerprint

Cite this