Metamath knowledge bases can be represented as grammar-compressed proof terms, a view that supports automated lemma discovery and analysis of human versus machine proof structuring.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mathematical Knowledge Bases as Grammar-Compressed Proof Terms: Exploring Metamath Proof Structures
Metamath knowledge bases can be represented as grammar-compressed proof terms, a view that supports automated lemma discovery and analysis of human versus machine proof structuring.