论文信息 - Translating Mizar for First Order Theorem Provers

Translating Mizar for First Order Theorem Provers

The constructor system of the Mizar proof checking system is explained here on examples from Mizar articles, and its translation to untyped first-order syntax is described and discussed. This makes the currently largest library of formalized mathematics available to first-order theorem provers.

Josef Urban

[1] Ingo Dahn,et al. Interpretation of a Mizar-Like Logic in First-Order Logic , 1998, FTP.

[2] William McCune,et al. OTTER 3.0 Reference Manual and Guide , 1994 .

[3] Christoph Weidenbach. System Description: Spass Version 1.0.0 , 1999, CADE.

[4] Krzysztof Hryniewiecki,et al. Basic Properties of Real Numbers , 2004 .

[5] Johann Schumann,et al. Automated Theorem Proving in Software Engineering , 2001, Springer Berlin Heidelberg.

[6] José Meseguer,et al. Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..