Summary
The object of this paper is to demonstrate how certain tricky mathematical arguments can be encoded as short formal proofs for the propositional tautologies representing the mathematical statements. Using resolution as a base proof system for the propositional calculus, we exhibit these short proofs under resolution augmented by one of two principles: the principle of extension, originally suggested by Tseitin, and the principle of symmetry, introduced in this paper. These short proofs illustrate the power of extension and symmetry in theorem proving.
The principle of extension allows the introduction of auxiliary variables to represent intermediate formulas so that the length of a proof can be significantly reduced by manipulating these variables instead of the formulas that they stand for. Symmetry, on the other hand, allows one to recognize that a tautology remains invariant under certain permutations of variable names, and use that information to avoid repeated independent derivations of intermediate formulas that are merely permutational variants of one another.
First we show that a number of inductive arguments can be encoded as short formal proofs using either extension or symmetry. We provide the details for the tautologies derived by encoding the statement, “An acyclic digraph on n vertices must have a source.” We then consider the familiar checkerboard puzzle which asserts that a checkerboard, two of whose diagonally opposite corner squares are removed, cannot be perfectly covered with dominoes. We demonstrate short proofs for the tautologies derived from the above assertion, using extension to mimic the tricky informal argument. Finally, we consider statements asserting the Ramsey property of numbers much larger than the critical Ramsey numbers. We show that the proof of Ramsey's theorem can be imitated using the principle of symmetry to yield short proofs for these tautologies.
The main theme of the paper is that both extension and symmetry are very powerful augmentations to resolution. We leave open whether either extension or symmetry can polynomially simulate the other.
Similar content being viewed by others
References
Bauer, M., Brand, D., Fischer, M.J., Meyer, A.R., Paterson, M.S.: A Note on Disjunctive Form Tautologies. SIGACT News 5, 17–20 (1973)
Ben-ari, M.: A Simplified Proof That Regular Resolution is Exponential. Inf. Process. Lett. 10, 96–98 (1980)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. New York: North Holland 1979
Chang, C.L., Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press 1973
Cook, S.A.: The Complexity of Theorem Proving Procedures. Proc. of the Third Annual ACM Symp. on Th. of Computing pp. 151–158 (1971)
Cook, S.A.: Feasibily Constructive Proofs in the Prepositional Calculus. Proc. of the Seventh Annual ACM Symp. on Th. of Computing pp. 83–97 (1975)
Cook, S.A.: A Short Proof on the Pigeon-hole Principle Using Extended Resolution. SIGACT News 8, 28–32 (1976)
Cook, S.A., Reckhow, R.A.: The Relative Efficiency of Prepositional Proof Systems. J. Symb. Logic 44, 36–50 (1979)
Dunham, B., Wang, H.: Towards Feasible Solutions of the Tautology Problem. Ann. Math. Logic 10, 117–154 (1976)
Galil, Z.: The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus. Ph.D. Thesis, Dept. of Computer Science, Cornell University, 1975
Haken, A.: The Intractability of Resolution. Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1984
Kleene, S.: Mathematical Logic. New York: Wiley 1967
Krishnamurthy, B., Moll, R.N.: Examples of Hard Tautologies in the Propositional Calculus. Proc. of the Thirteenth ACM Symp. on Th. of Computing pp. 28–37 (1981)
Reckhow, R.A.: On the Lengths of Proofs in the Propositional Calculus. Ph.D. Thesis, Dept. of Computer Science, University of Toronto, 1976
Robinson, J.A.: A Machine Oriented Logic Based on the Resolution Principle. J. ACM 12, 23–41 (1965)
Tseitin, G.S.: On the Complexity of Derivations in Propositional Calculus. In: Structures in Constructive Mathematics and Mathematical Logic, II. A.O. Slisenko (ed.), pp. 115–125, 1968
Author information
Authors and Affiliations
Additional information
This work was performed while the author was with the General Electric Research Center
Rights and permissions
About this article
Cite this article
Krishnamurthy, B. Short proofs for tricky formulas. Acta Informatica 22, 253–275 (1985). https://doi.org/10.1007/BF00265682
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265682