Abstract
We analyze the logical strength of theorems on marriage problems with unique solutions using the techniques of reverse mathematics, restricting our attention to problems in which each boy knows only finitely many girls. In general, these marriage theorems assert that if a marriage problem has a unique solution then there is a way to enumerate the boys so that for every m, the first m boys know exactly m girls. The strength of each theorem depends on whether the underlying marriage problem is finite, infinite, or bounded.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang G.J.: On the number of SDR of a (t,n)-family. Eur. J. Combin. 10(3), 231–234 (1989). doi:10.1016/S0195-6698(89)80056-3
Hall M. Jr.: Distinct representatives of subsets. Bull. Am. Math. Soc. 54(10), 922–926 (1948). doi:10.1090/S0002-9904-1948-09098-X
Hall P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935). doi:10.1112/jlms/s1-10.37.26
Hirst, J.L.: Marriage theorems and reverse mathematics. In: Logic and computation (Pittsburgh, PA, 1987), Contemp. Math., vol. 106, pp. 181–196. Am. Math. Soc., Providence, RI (1990). doi:10.1090/conm/106/1057822
Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Logic, 2nd edn. Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie, NY (2009). doi:10.1017/CBO9780511581007
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hirst, J.L., Hughes, N.A. Reverse mathematics and marriage problems with unique solutions. Arch. Math. Logic 54, 49–57 (2015). https://doi.org/10.1007/s00153-014-0401-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-014-0401-z