3 ms·
Just to make it explicit, checking an existing proof is very decidable, given a reasonable programming language. Now getting that proof does pose some practica
by andrewflnr 3y ago
Just to make it explicit, checking an existing proof is very decidable, given a reasonable programming language. Now getting that proof does pose some practical difficulties, but it would doubtless be built up by fairly simple proofs derived from user-supplied editing steps; a bit of a pain, but not Halting-complete.