More on the cut and choose game

Details More on the cut and choose game More on the cut and choose game

1994-03-10

arxiv.org/abs/math/9403203v1

Mathematics

Logic

Scientific paper

We improve some ancient results of Velickovic on the cut and choose (c&c) game on complete Boolean algebras. (1) If Nonempty has a winning strategy for c&c game on $B$ then $B$ is semiproper. (2) If Nonempty has a winning strategy and $B$ has $2^{\aleph _0}$ -c.c. then Nonempty has a winning strategy in the descending chain game. (3) Cons ($B$ is $\aleph _1$-distributive implies Nonempty has a winning strategy in c&c on $B$ ) We also give some new examples of forcings where Nonempty has or does not have a winning strategy in c&c game.

Affiliated with

Also associated with

No associations

Rating

More on the cut and choose game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with More on the cut and choose game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and More on the cut and choose game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-91566