<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Metamath Zero: The Cartesian Theorem Prover · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1910.10703/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1910.10703/feed.xml" rel="self" type="application/rss+xml" /><item><title>Metamath Zero: The Cartesian Theorem Prover — mentioned by Smaug123</title><link>https://news.ycombinator.com/item?id=39398983</link><guid isPermaLink="false">urn:hackerpapers:mention:1910.10703:39398983</guid><pubDate>Fri, 16 Feb 2024 16:16:38 GMT</pubDate><description>&lt;p&gt;Along similar lines, Mario Carneiro wrote a formalisation of a subset of x86 in MetaMath Zero (https://github.com/digama0/mm0/blob/master/examples/x86.mm0) with the ultimate goal of proving that the MetaMath Zero verifier itself is sound. https://arxiv.org/pdf/1910.10703.pdf (And of course Permutation City is a fiction book all about emulating computers with sound properties!)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1910.10703/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Metamath Zero: The Cartesian Theorem Prover — mentioned by cevi</title><link>https://news.ycombinator.com/item?id=35225686</link><guid isPermaLink="false">urn:hackerpapers:mention:1910.10703:35225686</guid><pubDate>Mon, 20 Mar 2023 00:49:28 GMT</pubDate><description>&lt;p&gt;Thanks - I hadn&amp;#x27;t looked into Metamath Zero before, but it sounds like that would be the right thing to compare Abstraction Logic to! Skimming https://arxiv.org/abs/1910.10703 makes it seem like Metamath Zero still operates at the level of schema, but has some other changes compared to Metamath that are too subtle for me to digest in an afternoon.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1910.10703/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Metamath Zero: The Cartesian Theorem Prover — mentioned by philzook</title><link>https://news.ycombinator.com/item?id=26290909</link><guid isPermaLink="false">urn:hackerpapers:mention:1910.10703:26290909</guid><pubDate>Sun, 28 Feb 2021 05:24:50 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s a question I hadn&amp;#x27;t really considered before. On first pass, as far as I know, I&amp;#x27;d say the answer is no. It isn&amp;#x27;t clear to me what the objective of embedding Coq with a C api for example would be. The very core of Coq is about verifying proofs and not producing them and I&amp;#x27;m not sure what the benefit of embedding it is. Having said that there are a few projects that may be something like what you&amp;#x27;re asking. First off, Coq has the SerAPI project https://github.com/ejgallego/coq-serapi through which external programs can talk to coq. This has been used for example to make a python OpenAi…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1910.10703/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Metamath Zero: The Cartesian Theorem Prover — mentioned by raphlinus</title><link>https://news.ycombinator.com/item?id=25061587</link><guid isPermaLink="false">urn:hackerpapers:mention:1910.10703:25061587</guid><pubDate>Wed, 11 Nov 2020 19:00:19 GMT</pubDate><description>&lt;p&gt;There is work on making proofs portable from one system to another. One effort is Dedukti, which is based on the idea that &amp;quot;lambda pi modulo&amp;quot; is a universal logic for theorem provers. A less ambitious effort is OpenTheory, which from what I can tell is mostly about being able to interoperate between different HOL flavors. And one of the efforts I personally find most interesting is Metamath Zero, which attempts to be an interchange format among other things, with connections to HOL and Lean. See section 5 of: https://arxiv.org/abs/1910.10703 I think there are many provers which theoretically…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1910.10703/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item><item><title>Metamath Zero: The Cartesian Theorem Prover — HN submission</title><link>https://news.ycombinator.com/item?id=21358674</link><guid isPermaLink="false">urn:hackerpapers:submission:1910.10703:21358674</guid><pubDate>Fri, 25 Oct 2019 20:01:45 GMT</pubDate><description>&lt;p&gt;Metamath Zero, a bootstrapping theorem prover&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;125 points; 36 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1910.10703/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
