伪幂的可表示性和Compactness
Representability and Compactness for Pseudopowers
摘要：
证明了$pp_{Γ(μ,σ)}(μ)$形式的伪幂运算的一个紧性定理，其中$\aleph_0<σ=cf(σ)\leq cf(μ)$ .我们的主要工具是一个结果，有谢拉的cov与pp定理的后果。我们还表明，在其他情况下的紧性的失败有显着的后果PCF理论，特别是，这意味着存在一个渐进的定期基数集$A$的$pcf(A)$有一个不可访问的聚集点。
英文摘要：
We prove a compactness theorem for pseudopower operations of the form $pp_{Γ(μ,σ)}(μ)$ where $\aleph_0<σ=cf(σ)\leq cf(μ)$. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
