Abstract
We analyze the logical strength of theorems on marriage problems with a fixed finite number of solutions via the techniques of reverse mathematics. We show that if a marriage problem has k solutions, then there is a finite set of boys such that the marriage problem restricted to this set has exactly k solutions, each of which extend uniquely to a solution of the original marriage problem. The strength of this assertion depends on whether or not the marriage problem has a bounding function. We also answer three questions from our previous work on marriage problems with unique solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
