Switch to: Citations

Add references

You must login to add references.
  1. A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
    After presenting a general setting in which to look at forcing axioms, we give a hierarchy of generalized bounded forcing axioms that correspond level by level, in consistency strength, with the members of a natural hierarchy of large cardinals below a Mahlo. We give a general construction of models of generalized bounded forcing axioms. Then we consider the bounded forcing axiom for a class of partially ordered sets Γ 1 such that, letting Γ 0 be the class of all stationary-set-preserving (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.
    In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2ω = ω2 and that [Formula: see text] satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that □ fails for all regular κ > ω1.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  • On coherent families of finite-to-one functions.Piotr Koszmider - 1993 - Journal of Symbolic Logic 58 (1):128-138.
    We consider the existence of coherent families of finite-to-one functions on countable subsets of an uncountable cardinal κ. The existence of such families for κ implies the existence of a winning 2-tactic for player TWO in the countable-finite game on κ. We prove that coherent families exist on κ = ωn, where n ∈ ω, and that they consistently exist for every cardinal κ. We also prove that iterations of Axiom A forcings with countable supports are Axiom A.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The bounded proper forcing axiom.Martin Goldstern & Saharon Shelah - 1995 - Journal of Symbolic Logic 60 (1):58-73.
    The bounded proper forcing axiom BPFA is the statement that for any family of ℵ 1 many maximal antichains of a proper forcing notion, each of size ℵ 1 , there is a directed set meeting all these antichains. A regular cardinal κ is called Σ 1 -reflecting, if for any regular cardinal χ, for all formulas $\varphi, "H(\chi) \models`\varphi'"$ implies " $\exists\delta . We investigate several algebraic consequences of BPFA, and we show that the consistency strength of the bounded (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   22 citations