Following a line of research initiated in [4], we describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cichoń diagram for cardinal characteristics of the continuum. We show that working from relatively modest assumptions about a notion of reduction, one can construct a robust version of such a diagram. As an application, we define and investigate the Cichoń diagram for degrees of constructibility relative to a fixed inner model W. Many analogies (...) hold with the classical theory as well as some surprising differences. Along the way, we introduce a new axiom stating, roughly, that the constructibility diagram is as complex as possible. (shrink)

The following pcf results are proved:1. Assume thatκ>ℵ0κ>ℵ0is a weakly compact cardinal. Letμ>2κμ>2κbe a singular cardinal of cofinality κ. Then for every regularView the MathML sourceλ sup{suppcfσ⁎-complete|a⊆Reg∩and|a|<μ}.Turn MathJax onAs an application we show that:if κ is a measurable cardinal andj:V→Mj:V→Mis the elementary embedding by a κ-complete ultrafilter over κ, then for every τ the following holds:1. ifjjis a cardinal thenj=τj=τ;2. |j|=|j)||j|=|j)|;3. for any κ-complete ultrafilter W on κ, |j|=|jW||j|=|jW|.The first two items provide affirmative answers to questions from Gitik and Shelah (...) [2] and the third to a question of D. Fremlin. (shrink)

We investigate pseudopowers of singular cardinals and deduce some consequences for covering numbers at singular cardinals of uncountable cofinality.

We study the projective posets and their properties as forcing notions. We also define Martin's axiom restricted to projective sets, MA, and show that this axiom is weaker than full Martin's axiom by proving the consistency of ZFC + ¬lCH + MA with “there exists a Suslin tree”, “there exists a non-strong gap”, “there exists an entangled set of reals” and “there exists κ < 20 such that 20 < 2k”.