2 ms·
If math notation was unambiguous, automatic theorem provers would take that as input instead of inventing their own languages.
by fooker 8y ago
If math notation was unambiguous, automatic theorem provers would take that as input instead of inventing their own languages.