Reverse mathematics and marriage problems with finitely many solutions

DOI10.1007/S00153-016-0509-4zbMATH Open1355.03011OpenAlexW2523057038MaRDI QIDQ335003FDOQ335003

Authors: Jeffry L. Hirst, Noah A. Hughes 

Publication date: 1 November 2016

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-016-0509-4

Recommendations

• Reverse mathematics and marriage problems with unique solutions
• On the strength of marriage theorems and uniformity
• Proof pearl: the marriage theorem
• Publication:3478406
• scientific article; zbMATH DE number 2236627
• Injective choice functions
• The computational strength of matchings in countable graphs
• scientific article; zbMATH DE number 7377981
• Hindman's theorem, ultrafilters, and reverse mathematics
• Equivalence between theorems: the research program of reverse mathematics

zbMATH Keywords

matchingbipartite graphreverse mathematicsmarriage theorems

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Subsystems of second order arithmetic
• Reverse mathematics and marriage problems with unique solutions
• Title not available (Why is that?)
• Meeting of the Association for Symbolic Logic, Chicago 1975
• Representations of Reals in Reverse Mathematics

Cited In (7)

• Reverse mathematics and marriage problems with unique solutions
• A generalization of balanced tableaux and marriage problems with unique solutions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the strength of marriage theorems and uniformity
• Title not available (Why is that?)
• Proof pearl: the marriage theorem

This page was built for publication: Reverse mathematics and marriage problems with finitely many solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335003)