- #1
T S Bailey
- 26
- 0
Godels Incompleteness Theorem states that for any formal system with finitely recursive axioms we can construct a Godel sentence G that is unprovable within that system but is none the less true. Does this still apply to formal systems which, instead of creating Godel numbers for arithmetical formulas, created them for first order logic operations? Is first order logic inconsistent or incomplete?