Reverse mathematics and marriage problems with finitely many solutions
From MaRDI portal
Publication:335003
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
Cites work
Cited in
(7)- Reverse mathematics and marriage problems with unique solutions
- A generalization of balanced tableaux and marriage problems with unique solutions
- scientific article; zbMATH DE number 4148082 (Why is no real title available?)
- scientific article; zbMATH DE number 2236627 (Why is no real title available?)
- On the strength of marriage theorems and uniformity
- scientific article; zbMATH DE number 424592 (Why is no real title available?)
- 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)