A syntactical proof of the Marriage Lemma. (English) Zbl 1051.03048
Summary: We give a proof of the classical Marriage Lemma [P. R. Halmos and H. E. Vaughan, Am. J. Math. 72, 214–215 (1950; Zbl 0034.29601)] using completeness of hyperresolution. This argument is purely syntactical, and extends directly to the infinite case. As an application we give a purely syntactical version of a proof that resolution is exponential on the pigeon-hole principle.
MSC:
| 03F20 | Complexity of proofs |
| 03B35 | Mechanization of proofs and logical operations |
| 05A05 | Permutations, words, matrices |
Citations:
Zbl 0034.29601References:
| [1] | P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, Proc. of FOCS’86.; P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, Proc. of FOCS’86. · Zbl 0908.68164 |
| [2] | J. Cederquist, Th. Coquand, Entailment relations and distributive lattices, Proc. of Logic Colloquium 98, Prague, Lect. Notes Log. 13, Assoc. Symbol. Logic, Urbana, IL, 2000, pp. 127-139.; J. Cederquist, Th. Coquand, Entailment relations and distributive lattices, Proc. of Logic Colloquium 98, Prague, Lect. Notes Log. 13, Assoc. Symbol. Logic, Urbana, IL, 2000, pp. 127-139. · Zbl 0948.03056 |
| [3] | Coquand, Th.; Persson, H., Valuations and Dedekind Prague theorem, J. Pure Appl. Algebra, 155, 121-129 (2001) · Zbl 0983.11061 |
| [4] | Coquand, Th.; Zhang, G.-Q., Sequents, frame and completness, (Clote, P.; Schwichtenberf, H., CSL2000. CSL2000, Lecture Notes in Computer Science, Vol. 1862 (2000), Springer: Springer Berlin), 277-291 · Zbl 0973.03080 |
| [5] | Halmos, P.; Vaughan, H. E., The marriage problem, Amer. J. Math., 72, 214-215 (1950) · Zbl 0034.29601 |
| [6] | V. Lifschitz, Semantical completeness theorem in logic and algebra, Proc. Amer. Math. Soc., Vol. 79, 1980, pp. 89-96.; V. Lifschitz, Semantical completeness theorem in logic and algebra, Proc. Amer. Math. Soc., Vol. 79, 1980, pp. 89-96. · Zbl 0453.03060 |
| [7] | Y. Matiyasevich, Proof Procedures as Bases for Metamathematical Proofs in Discrete Mathematics. Available on the web address http://logic.pdmi.ras.ru/yumat/journal/jcontord.htm.; Y. Matiyasevich, Proof Procedures as Bases for Metamathematical Proofs in Discrete Mathematics. Available on the web address http://logic.pdmi.ras.ru/yumat/journal/jcontord.htm. |
| [8] | Quine, Q. V., The problem of simplifying truth functions, Am. Meth. Monthly, 59, 521-531 (1952) · Zbl 0048.24503 |
| [9] | Rado, R., Note on the transfinite case of Hall’s theorem on representatives, J. London Math. Soc., 42, 321-324 (1967) · Zbl 0159.01803 |
| [10] | Robinson, J. A., The generalised resolution principle, Mach. Intell., 3, 77-93 (1968) · Zbl 0195.31102 |
| [11] | D. Scott, Completeness and axiomatizability, Proc. Tarski Sympos., 1974, pp. 411-435.; D. Scott, Completeness and axiomatizability, Proc. Tarski Sympos., 1974, pp. 411-435. · Zbl 0318.02021 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
