Peter B. Andrews Explained

Peter Bruce Andrews (born 1937) is an American mathematician and Professor of Mathematics, Emeritus at Carnegie Mellon University in Pittsburgh, Pennsylvania,^[1] and the creator of the mathematical logic Q₀. He received his Ph.D. from Princeton University in 1964 under the tutelage of Alonzo Church.^[2] He received the Herbrand Award in 2003.^[3] His research group designed the TPS automated theorem prover. A subsystem ETPS (Educational Theorem Proving System) of TPS is used to help students learn logic by interactively constructing natural deduction proofs.

Publications

Andrews, Peter B. (1965). A Transfinite Type Theory with Type Variables. North Holland Publishing Company, Amsterdam.
Andrews, Peter B. (1971). "Resolution in type theory". Journal of Symbolic Logic 36, 414–432.
Andrews, Peter B. (1981). "Theorem proving via general matings". J. Assoc. Comput. March. 28, no. 2, 193–214.
Andrews, Peter B. (1986). An introduction to mathematical logic and type theory: to truth through proof. Computer Science and Applied Mathematics. . Academic Press, Inc., Orlando, FL.
Andrews, Peter B. (1989). "On connections and higher-order logic". J. Automat. Reason. 5, no. 3, 257–291.
Andrews, Peter B.; Bishop, Matthew; Issar, Sunil; Nesmith, Dan; Pfenning, Frank; Xi, Hongwei (1996). "TPS: a theorem-proving system for classical type theory". J. Automat. Reason. 16, no. 3, 321–353.
Andrews, Peter B. (2002). An introduction to mathematical logic and type theory: to truth through proof. Second edition. Applied Logic Series, 27. . Kluwer Academic Publishers, Dordrecht.

External links

Peter B. Andrews

Notes and References

Web site: Peter B. Andrews. gtps.math.cmu.edu. 2018-03-10.
Web site: Alonzo Church - The Mathematics Genealogy Project. www.genealogy.math.ndsu.nodak.edu. 2018-03-10.
Andrews. Peter B.. 2003-10-01. Herbrand Award Acceptance Speech. Journal of Automated Reasoning. en. 31. 2. 169–187. 10.1023/b:jars.0000009552.54063.f3. 0168-7433. 10.1.1.69.5121. 9542444.