I can't quite say about the BCT question, it's not immediateThe key observations are that BPI is equivalent to me. Howeverthe Stone representation theorem for Boolean algebras, and that for the Rasiowa–Sikorski lemma we can focus on [complete] Boolean algebras, since they are forcing equivalent (so we can restrict the answer is negativegenerality of partial orders).
Recall thatNow, one implication is a consequence of ZF. Since RS is equivalent to Dependent Choice, which itself is equivalent to the statement "Every tree of height $\omega$ without maximal nodes has an infinite branch". Notedownward Löwenheim–Skolem theorem, one can just use that argument.
Alternatively, if $T$ is a tree, then a generic filter$X$ is a branchcompact Hausdorff space and $D_n$ are dense open sets, i.eand without loss of generality $D_{n+1}\subseteq D_n$. take $U$ to be a maximal chain. But nownon-empty open set, ifand consider the forcing whose conditions are sequences $T$$(x_i,W_i)_{i<n}$ such that $x_i\in D_i\cap U$ and $W_i$ is a treeopen such that:
- $x_i\in W_i\subseteq \overline W_i\subseteq U\cap D_i$, and
- $\overline W_i\subseteq W_j$ if $j<i$.
Now consider $E_n$ to be the dense open set in the forcing whose conditions are sequences of heightlength at least $\omega$ and$n$. By the R–SRasiowa–Sikorski lemma holds, then $D_n=T\setminus T\restriction n$ (thatthere is, a generic meeting all the nodes of heightthese $>n$)$E_n$s which defines a sequence $(x_i,W_i)_{i<\omega}$. Now observe that $\{\overline W_i\mid i<\omega\}$ is a countable family of dense opencompact sets, and with a genericfinite intersection property, therefore their intersection is non-empty, and it contains a branch. Therefore Dependent Choice must holdpoint in $\bigcap D_i\cap U$ as wanted.
This, along with the result you mention (which I can't verify atIn the moment) suggest that BCT for compact Hausdorff spaces is equivalentother direction we need to $\sf DC$ over $\sf ZF+BPI$. Of courseuse BPI, and we use it in the interesting question isform of Stone's representation theorem. Given a notion of forcing, since we knowmay assume without loss of generality that it is a complete Boolean algebra $\sf DC$$B$ and we can consider its Stone space, $\sf BPI$ are entire independent$S(B)$, the space of each otherall the ultrafilters on $B$.
If $D\subseteq B$ is a dense open set, then $D^*=\{F\in S(B)\mid\exists b\in D, b\in F\}$ is there a model wheredense open set in $S(B)$. Therefore, by the BCT for compact Hausdorff spaces hold, butif $\sf DC$ fails? Or rather$D_n$ is a sequence of dense open subsets of $B$, what$\bigcap D^*_n$ is that model?dense, and in particular not empty. Take any $G\in\bigcap D_n^*$, then for all $n<\omega$, $G\cap D_n$ is non-empty as wanted.