## Godel’s 1st incompleteness theorem - clarification.

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

This should be a trivial question for people who know Gödel's 1st incompleteness theorem. I quote the statement the theorem from wikipedia: "Any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete. In particular, for any consistent, effectively generated formal theory that proves certain basic arithmetic truths, there is an arithmetical statement that is true, but not provable in the theory."

My question is: what is the meaning of 'true' in the last sentence? Let me elaborate: the only (introductory) proof of the theorem that I know starts with a specific model of the theory and constructs a sentence which is true in that model, but not provable from the theory.

So does `true arithmetical statement' in the statement of the theorem mean `true in the (implicitly) given model', or true in EVERY model?

-

## 2 Answers

It means true in the usual model. For 1st order logic we have Godel's Completeness theorem, which guarantees that if something is true in every model, then it is actually provable in the theory.

-

Thanks, I guess was confusing true' with valid'. – auniket Nov 6 2009 at 21:59

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

As already pointed out here by Tom Leinster, "true" doesn't make sense without some sort of model. It is a technical word.

-

That assumes a contentious position in the philosophy of mathematics.  Some people think that there are no such things as numbers - all there are are various models of arithmetic, and in one context or another we can choose one of these models to be what we're talking about when we use the word "number".  (This view gets into a sort of regress problem though when we ask what a model is rather than a number.) – Kenny Easwaran Nov 6 2009 at 6:19
The other view is that the word "number" has an ordinary meaning, and what it means to say that a statement like "every number has property X" is true is just to say that every number actually has property X.  On this view, it seems that every arithmetical statement (that is grammatically well-formed) must be either true or false.  There may be some model in the set-theoretic sense such that truth-in-that-model coincides with plain old truth, but that's not needed for the notion of truth to make sense. – Kenny Easwaran Nov 6 2009 at 6:19
You raise interesting points. I wasn't meaning to get too deep into the philosophical tangent, but at least in the sense of the question above there's no reason to think of Gödel's "true" as anything other than the strict definition. – Jason Dyer Nov 6 2009 at 16:05
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9482204914093018, "perplexity_flag": "middle"}