3 ms·
Checking a series of logical statements is just arithmetic. Generating a series of logical statements is only hard because the formal statements are not genera
by gohrt 12y ago
Checking a series of logical statements is just arithmetic.
Generating a series of logical statements is only hard because the formal statements are not generated axiomatically, they are sourced from ill-understood human creativity. Once a formalism is defined it is trivial O(e^n) algorithm to generate all proofs of size n.
http://math.stackexchange.com/questions/324867/automated-proof-checking-machine http://math.stackexchange.com/questions/324867/automated-pro...
- colanderman 12y agoTo be fair, n may be arbitrarily large, hence the undecidability of logics in general. (Not disagreeing with you, just clarifying.)