3 ms·
OK, just as a check to see if I'm following this thread: we have a theorem, wlog A implies B, and we'd like a proof. A motivated proof would say A implies foo,
by 082349872349872 4y ago
OK, just as a check to see if I'm following this thread: we have a theorem, wlog A implies B, and we'd like a proof.
A motivated proof would say A implies foo, and foo implies bar, and bar implies B, where foo and bar are small expressions using concepts common to the theory we're working with.
A searched proof would say A implies broguefleagle (so broguefleagles exist) and broguefleagle implies B, where broguefleagle is some odd expression that doesn't seem to occur anywhere else within the practise of this theory (a "rabbit out of a hat")?
What have I gotten wrong?
- zozbot234 4y agoThis is what the project seems to give as their preferred examples, yes. (Though they also seem to think of this in terms of allowed "moves", which I think are heuristically-picked rules of inference? So they're sort of playing with something that's almost but not quite entirely unlike the usual notion of a restricted logic, chosen for computational tractability.) Of course my own view is that the more useful notion, in a general sense, is simply "a proof that's easy enough to find, not just check after the fact", which might not be exactly the same.