论文信息 - Computer proofs in Group Theory

Computer proofs in Group Theory

This paper reports the results of an experiment in using the Boyer-Moore Theorem Prover in seeking computer-checked proofs in Group Theory. Starting from the axioms for groups and elementary list and number theory, the theorem prover was led to the proofs of two basic theorems in Elementary Group Theory by a sequence of lemmas suggested by the author. The computer proofs illustrate the effective use of the Boyer-Moore Theorem Prover in Group Theory.

Yuan Yu | Yuanxun Yu

[1] F Houze,et al. Determination of the effective contact radius between a conducting sphere and a thin metallic film , 1988 .

[2] Natarajan Shankar,et al. Towards mechanical metamathematics , 1985, Journal of Automated Reasoning.

[3] Larry Wos,et al. Automated reasoning - 33 basic research problems , 1988 .

[4] Matt Kaufmann,et al. DEFN-SK: An Extension of the Boyer-Moore Theorem Prover to Handle First-Order Quantifiers ***DRAFT*** , 1989 .

[5] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.

[6] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[7] Larry Wos,et al. Set theory in first-order logic: Clauses for Gödel's axioms , 1986, Journal of Automated Reasoning.

[8] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

[9] Larry Wos,et al. What Is Automated Reasoning? , 1987, J. Autom. Reason..

[10] David M. Russinoff. An experiment with the Boyer-Moore theorem prover: A proof of Wilson's theorem , 1985, Journal of Automated Reasoning.