Strongly Baire trees and a cofinal branch principle

DOI10.1007/BF02773564zbMATH Open0951.03042MaRDI QIDQ1567337FDOQ1567337

Qi Feng

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

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

Cites Work

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

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567337)