Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)

DOI10.1112/PLMS/S3-25.4.615zbMATH Open0251.05001OpenAlexW2090451983MaRDI QIDQ5663873FDOQ5663873

Alfred B. Manaster, Joseph G. Rosenstein

Publication date: 1972

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/plms/s3-25.4.615

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Applications of computability and recursion theory (03D80) Proof theory and constructive mathematics (03F99)

Cited In (14)

• Index sets for \(\Pi^0_1\) classes
• A theory of nonmonotonic rule systems. II
• Countable thin \(\Pi^0_1\) classes
• Hamiltonian paths in infinite graphs
• One-transversal families
• Recursive Euler and Hamilton Paths
• Marriage in denumerable societies
• On the strength of marriage theorems and uniformity
• \(A\)-computable graphs
• Computable paradoxical decompositions
• Recursively presented games and strategies
• Computing planarity in computable planar graphs
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes

This page was built for publication: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)

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