Corpus ID: 204852046

Metamath Zero: The Cartesian Theorem Prover

@article{Carneiro2019MetamathZT,
  title={Metamath Zero: The Cartesian Theorem Prover},
  author={Mario M. Carneiro},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.10703}
}
  • Mario M. Carneiro
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • As the usage of theorem prover technology expands, so too does the reliance on correctness of the tools. Metamath Zero is a verification system that aims for simplicity of logic and implementation, without compromising on efficiency of verification. It is formally specified in its own language, and supports a number of translations to and from other proof languages. This paper describes the abstract logic of Metamath Zero, essentially a multi-sorted first order logic, as well as the binary… CONTINUE READING
    2 Citations

    Paper Mentions

    References

    SHOWING 1-10 OF 24 REFERENCES
    CakeML: a verified implementation of ML
    • 256
    • PDF
    A self-verifying theorem prover
    • 21
    • PDF
    A Verified Runtime for a Verified Theorem Prover
    • 34
    • PDF
    Coq en Coq
    • 22
    Specifying verified x86 software from scratch
    • 3
    • PDF
    Dafny: An Automatic Program Verifier for Functional Correctness
    • 738
    • PDF
    Towards Self-verification of HOL Light
    • 92
    • PDF
    Models for Metamath
    • 2
    • PDF
    An overview of the K semantic framework
    • 325
    Why3 - Where Programs Meet Provers
    • 341
    • PDF