Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T10:03:27.125Z Has data issue: false hasContentIssue false

Applications of PCF theory

Published online by Cambridge University Press:  12 March 2014

Saharon Shelah*
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem, IsraelRutgers University, Department of Mathematics, New Brunswick, NJ, USA, E-mail:shelah@math.huji.ac.il

Abstract

We deal with several pcf problems: we characterize another version of exponentiation: maximal number of k-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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable