We present an algorithm for converting proofs from the OpenTheory interchange format, which can be translated to and from any of the HOL family of proof languages (HOL4, HOL Light, ProofPower, and Isabelle), into the ZFC-based Metamath language. This task is divided into two steps: the translation of an OpenTheory proof into a Metamath HOL formalization, hol.mm, followed by the embedding of the HOL formalization into the main ZFC foundations of the main Metamath library, set.mm. This process provides a means to link the simplicity of the Metamath foundations to the intense automation efforts which have borne fruit in HOL Light, allowing the production of complete Metamath proofs of theorems in HOL Light, while also proving that HOL Light is...
Abstract. New proof assistant developments often involve concepts sim-ilar to already formalized one...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Church's Higher Order Logic is a basis for influential proof assistants --HOL and PVS. Church's logi...
Abstract. We show how to encode the HOL Light logic in Coq. This makes an automatic translation of H...
Metis is an automated theorem prover based on ordered paramodulation. It is widely employed in the i...
One of the most important benefits of using a theorem prover system is the absolute accuracy of the ...
International audienceWe present a new scheme to translate mathematical developments from HOL Light ...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
International audienceDedukti is a logical framework based on the λΠ-calculus modulo rewriting, whic...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Abstract. There are two different approaches to formalizing proofs in a computer: the procedural app...
. The formal development of non-trivial, real-time systems can be made more manageable by using seve...
Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully forma...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
Abstract. New proof assistant developments often involve concepts sim-ilar to already formalized one...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Church's Higher Order Logic is a basis for influential proof assistants --HOL and PVS. Church's logi...
Abstract. We show how to encode the HOL Light logic in Coq. This makes an automatic translation of H...
Metis is an automated theorem prover based on ordered paramodulation. It is widely employed in the i...
One of the most important benefits of using a theorem prover system is the absolute accuracy of the ...
International audienceWe present a new scheme to translate mathematical developments from HOL Light ...
AbstractWe describe a proof dedicated meta-language, called L tac, in the context of t...
International audienceDedukti is a logical framework based on the λΠ-calculus modulo rewriting, whic...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
Abstract. There are two different approaches to formalizing proofs in a computer: the procedural app...
. The formal development of non-trivial, real-time systems can be made more manageable by using seve...
Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully forma...
Formalizing meta-theory, or proofs about programming languages, in a proof assistant has many well-k...
We investigate the development of a general-purpose framework for mechanized reasoning about the met...
Abstract. New proof assistant developments often involve concepts sim-ilar to already formalized one...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Church's Higher Order Logic is a basis for influential proof assistants --HOL and PVS. Church's logi...