A syntactical proof of the Marriage Lemma.

DOI10.1016/S0304-3975(02)00079-8zbMath1051.03048WikidataQ125020752 ScholiaQ125020752MaRDI QIDQ1853584

Thierry Coquand

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

resolutioncomplexity of proofspigeonhole principlehyperresolutionmarriage lemma

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)

Related Items (1)

Ordering groups constructively

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Valuations and Dedekind's Prague theorem
• Semantical Completeness Theorems in Logic and Algebra
• Note on the Transfinite Case of Hall's Theorem on Representatives
• The Marriage Problem
• The Problem of Simplifying Truth Functions

This page was built for publication: A syntactical proof of the Marriage Lemma.