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

DOI10.1112/plms/s3-25.4.615zbMath0251.05001OpenAlexW2090451983MaRDI QIDQ5663873

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)

Related Items

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