We define the notion of a determined Borel code in reverse math, and consider the principle DPB, which states that every determined Borel set has the property of Baire. We show that this principle is strictly weaker than ATR 0 . Any ω-model of DPB must be closed under hyperarithmetic reduction, but DPB is not a theory of hyperarithmetic analysis. We show that whenever M ⊆ 2 ω is the second-order part of an ω-model of DPB, then for every Z ∈ M , there is a G ∈ M such that G is ∆ 1 1 -generic relative to Z. Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in Logic.