Re:Incompleteness ex Machina – proving Gödel's theorems in t...
by rocqua on Sunday February 17, 2019 @03:20AM
(#19183318)
Wow, I thought it was required to have second order logic for godel to apply, but this seems to be a first order logic that is still undecidable.
Re:Incompleteness ex Machina – proving Gödel's theorems in t...
by ratmice on Sunday February 17, 2019 @04:22PM
(#19186990)
From the other side of the fence, another thing to look at would be the decidability of presburger, and skolem arithmetic, the following paper then goes over the extensions of these, which render the result undecidable.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.21...
For example, Robinson Arithmetic is a finitely axiomatized theory whose axioms contain only one existential quantifier, but just like full (Peano) arithmetic, it is subject to Gödel's incompleteness theorems.