arXiv Analytics

Sign in

arXiv:1906.09307 [math.LO]AbstractReferencesReviewsResources

Representability and Compactness for Pseudopowers

Todd Eisworth

Published 2019-06-21Version 1

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\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 $A$ of regular cardinals for which $pcf(A)$ has an inaccessible accumulation point.

Comments: Pre-submission version
Categories: math.LO
Subjects: 03E04
Related articles: Most relevant | Search more
arXiv:2306.16888 [math.LO] (Published 2023-06-29)
A new approach on distributed systems: orderings and representability
arXiv:2212.03677 [math.LO] (Published 2022-12-07)
Compactness in Team Semantics
arXiv:1503.03192 [math.LO] (Published 2015-03-11)
Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups