3 ms·
Not finite, but recursively enumerable, no? Since you can just start from PA and derive conclusions forever, so this is an effective procedure in that any true
by andrepd 8y ago
Not finite, but recursively enumerable, no? Since you can just start from PA and derive conclusions forever, so this is an effective procedure in that any true statement will eventually be thus produced.
- krusch 8y agoNo, even if you start with the axioms of PA and enumerate all theorems provable, you'll miss some true sentences, one of them being the Goedel sentence of PA.