<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>DeepAlgebra - an outline of a program · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1610.01044/</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/1610.01044/feed.xml" rel="self" type="application/rss+xml" /><item><title>DeepAlgebra - an outline of a program — mentioned by carapace</title><link>https://news.ycombinator.com/item?id=20789083</link><guid isPermaLink="false">urn:hackerpapers:mention:1610.01044:20789083</guid><pubDate>Sat, 24 Aug 2019 19:13:58 GMT</pubDate><description>&lt;p&gt;Related: https://arxiv.org/abs/1610.01044 &amp;quot;DeepAlgebra - an outline of a program&amp;quot; &amp;gt; We outline a program in the area of formalization of mathematics to automate theorem proving in algebra and algebraic geometry. We propose a construction of a dictionary between automated theorem provers and (La)TeX exploiting syntactic parsers. We describe its application to a repository of human-written facts and definitions in algebraic geometry (The Stacks Project). We use deep learning techniques.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1610.01044/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>DeepAlgebra - an outline of a program — mentioned by carapace</title><link>https://news.ycombinator.com/item?id=18466210</link><guid isPermaLink="false">urn:hackerpapers:mention:1610.01044:18466210</guid><pubDate>Fri, 16 Nov 2018 03:45:05 GMT</pubDate><description>&lt;p&gt;If you liked that you&amp;#x27;ll like this: http://www.markability.net/ It&amp;#x27;s a walk-through of George Spencer-Brown&amp;#x27;s Laws of Form. It turns out all logic can be modeled by simple containment, and there&amp;#x27;s a complete basis (discovered by Bricken): A() = () ((A))B = AB A(AB) = A(B) One interesting thing about LoF notation is that every expression is also a schematic of a logic circuit. The letters are inputs, the expression is the output, and each container represents a logical (multi-input) NOR gate. Another interesting thing about it is that it&amp;#x27;s significantly more efficient to derive proofs in LoF…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1610.01044/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
