Papers
Topics
Authors
Recent
Search
2000 character limit reached

On reaping number having countable cofinality

Published 19 Jan 2014 in math.LO | (1401.4649v1)

Abstract: We prove that if the bounding number (d) is bigger than the reaping number (r), then the latter has uncountable cofinality.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up