marwahaha
Joined 11 years ago
Karma
9
Submissions
14
Member since
Aug 19
https://kunalmarwaha.com/about
View on Hacker NewsJoined 11 years ago
The graph has an AND-OR structure. Each node (circle) is a theorem statement, and each directed hyperedge (square) is an implication. To prove a theorem statement, all of the children of one implication must be proved.
https://github.com/arxivwiki/kurin-paper-scraper https://github.com/arxivwiki/arxivwiki/blob/main/.github/wor... https://github.com/arxivwiki/arxivwiki/blob/main/.github/wor...
For example: https://arxiv.wiki/abs/2101.06861