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

DOI10.1112/PLMS/S3-25.4.615MaRDI QIDQ5663873zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(17)

• Recursively presented games and strategies
• Hamiltonian paths in infinite graphs
• Countable thin ^0_1 classes
• Marriage in denumerable societies
• Index sets for ^0_1 classes
• A theory of nonmonotonic rule systems. II
• On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
• One-transversal families
• Recursive Euler and Hamilton Paths
• Computing planarity in computable planar graphs
• Computable paradoxical decompositions
• On the strength of marriage theorems and uniformity
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
• Computable vs descriptive combinatorics of local problems on trees
• Paths, ends and the separation problem for infinite graphs
• \(A\)-computable graphs

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)