On the strength of marriage theorems and uniformity

DOI10.1002/malq.201300021zbMath1331.03015OpenAlexW1938681473MaRDI QIDQ5419204

Kojiro Higuchi, Makoto Fujiwara, Takayuki Kihara

Publication date: 6 June 2014

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

Full work available at URL: https://doi.org/10.1002/malq.201300021

zbMATH Keywords

bipartite graphtransversalreverse mathematicscomputabilitymarriageSDRWeihrauch reducibilitydistinct representativesuniform reducibility

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Pincherle's theorem in reverse mathematics and computability theory

Cites Work

• Unnamed Item
• Closed choice and a uniform low basis theorem
• Reverse mathematics and uniformity in proofs without excluded middle
• On uniform relationships between combinatorial problems
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Reverse mathematics, trichotomy, and dichotomy
• An Effective Version of Hall's Theorem
• Representations of Reals in Reverse Mathematics
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
• Distinct representatives of subsets