Strongly Baire trees and a cofinal branch principle

DOI10.1007/BF02773564zbMath0951.03042MaRDI QIDQ1567337

Feng Qi

Publication date: 9 July 2000

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Souslin treesemiproper forcing axiom\((\omega,\infty)\)-distributivitystrong reflection principlestrongly Baire tree

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items (2)

Rado’s Conjecture and its Baire version ⋮ The name for Kojman-Shelah collapsing function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More game-theoretic properties of Boolean algebras
• Partition relations for partially ordered sets
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• Topics in set theory. Lebesgue measurability, large cardinals, forcing axioms, rho-functions
• Forcing axioms and stationary sets
• Semiproper forcing axiom implies Martin maximum but not PFA⁺
• On a Conjecture of R. Rado
• Forcing closed unbounded sets
• Nonsplitting subset of _κ(κ⁺)
• Local Clubs, Reflection, and Preserving Stationary Sets
• A Countably Distributive Complete Boolean Algebra Not Uncountably Representable
• Countable approximations and Löwenheim-Skolem theorems
• Rado's conjecture and presaturation of the nonstationary ideal on ω₁
• Projective Stationary Sets and a Strong Reflection Principle
• Some combinatorial problems concerning uncountable cardinals
• Multiple Forcing

This page was built for publication: Strongly Baire trees and a cofinal branch principle