Live data from Hacker News

Kurt Gödel and the romance of logic

prospectmagazine.co.uk

51–52 of 52 posts

Re: Kurt Gödel and the romance of logic

#51

Actually, Gödel's theory is fairly accessible compared to, say, the General Theory of Relativity. All you have to know that the process of proving a statement is a fairly mechanical, step-by-step process. At that point, "statements that can be proven true" and "statements that be proven false" are two fairly defined sets. At that point, "there are some true statements that cannot be proven true" is moderately clear.…

i don’t know if it’s accurate, but i get the sense godel liked finding pathologies. for example, his “godel metric” as a solution to einstein’s general relativity showcased “unphysical” possibilities but was still a legitimate solution.

Re: Kurt Gödel and the romance of logic

#52
post #49
post #14

Earlier quoted context omitted.

The quality of being “true” is dependent on the model one is using. One can not talk about “truth” without being in a model. (Assuming we are talking about standard mathematical logic.). A statement in a first order system is provable if and only if it is true in all models for that system.

You either don't understand the point of the theorems or are being contrarian. In the context for the Incompleteness theorems, there are two 'kinds' of truths: a more informal kind used by all of us everyday and the mathematical kind as in, proven true under a given system. The entire purpose of the theorems is to establish that there exists theorems in the first set that are not in the second set, while being expres…

I used the term ‘truth’ as used in mathematical logic. In a given model a statement can be true or false. Under a given axiomatic system a statement is either provable or not. We don’t use the word “true” when dealing with statement under an axiomatic system. We do use the word when dealing with a statement in a given model.

Your third paragraph doens’t make sense. In first order logic a theorem is a statement that is true in all models and is one that is provable. This is a result of the Completeness Theorem.

Post reply on HN