Re: Request for Reference/Link to example of defining a theory/logic.




Scott wrote:

But from Godel's incompleteness
proof, FOL is incomplete. Thus, it is possible to contruct a predicate
P(x1,...,xn) such that FOL |- P & ~P but that P is true by
construction.

This is the sheerest nonsense. The incompleteneness theorem does not
show that a contradiction is provable in FOL (how could it possibly do
that when there is an elementary proof that no contradiction is
derivable as theorem in FOL)????

.



Relevant Pages