English

Representability and Compactness for Pseudopowers

Logic 2019-06-25 v1

Abstract

We prove a compactness theorem for pseudopower operations of the form ppΓ(μ,σ)(μ)pp_{\Gamma(\mu,\sigma)}(\mu) where 0<σ=cf(σ)cf(μ)\aleph_0<\sigma=cf(\sigma)\leq cf(\mu). Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also show that the failure of compactness in other situations has significant consequences for pcf theory, in particular, implying the existence of a progressive set AA of regular cardinals for which pcf(A)pcf(A) has an inaccessible accumulation point.

Keywords

Cite

@article{arxiv.1906.09307,
  title  = {Representability and Compactness for Pseudopowers},
  author = {Todd Eisworth},
  journal= {arXiv preprint arXiv:1906.09307},
  year   = {2019}
}

Comments

Pre-submission version

R2 v1 2026-06-23T10:00:21.061Z