PCF arithmetic without and with choice

Details PCF arithmetic without and with choice PCF arithmetic without and with choice

2009-05-19

arxiv.org/abs/0905.3021v3

Mathematics

Logic

Scientific paper

We deal with relatives of GCH which are provable. In particular we deal with
rank version of the revised GCH. Our motivation was to find such results when
only weak versions of the axiom of choice are assumed but some of the results
gives us additional information even in ZFC.

Affiliated with

Also associated with

No associations

Rating

PCF arithmetic without and with choice 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 PCF arithmetic without and with choice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PCF arithmetic without and with choice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699307