3 ms·
If you would have a proof, you could make an algorithm that verifies it, making it decidable, couldn’t you?
by kaba0 4y ago
If you would have a proof, you could make an algorithm that verifies it, making it decidable, couldn’t you?
- ebingdom 4y agoChecking proofs is decidable. Coming up with proofs is undecidable. This tool does the former, leaving the latter up to humans.