Partial choice functions for families of finite sets

Details Partial choice functions for families of finite sets Partial choice functions for families of finite sets

2008-08-05

arxiv.org/abs/0808.0535v2

Mathematics

Logic

Early version submitted to Fundamenta Mathematicae (16 June 2008), later withdrawn, in order to rewrite with more general resu

Scientific paper

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element sets has a choice function. In the case where m=p is prime, to obtain the independence result we make use of a permutation model in which the set of atoms has the structure of a vector space over the field of p elements. When m is non-prime, a suitable permutation model is built from the models used in the prime cases.

Affiliated with

Also associated with

No associations

Rating

Partial choice functions for families of finite sets 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 Partial choice functions for families of finite sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial choice functions for families of finite sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549299