# Some questions about implications of Godel's Completeness Theorem [closed]

I have read Gödel's original paper (1930 - reprinted into J.van Heijenoort (editor), From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931, 1967) but I'm still unsatisfied with my understanding of it.

Modern logic textbooks usually prove the theorem following Henkin's construction.

One of the peculiarity of Henkin's proof is that the "completeness" aspect (i.e.if A is valid it is provable) is somewhat of a by-product of model existence.

Gödel's proof use (natural) numbers. This is obvious (with insight) today that we know about Gödel's philosophical realism.

Hankin's construction avoid numbers but use the "syntactical stuff" to build the model. But this (according to my understanding) is not really different; in order to "run" the construction we need countable many symbols, and symbols are "abstract entities" (like numbers). I think that we really needs them : we cannot replace them with "physical" tally marks. So my question :

In what sense we can minimize the "ontological" import of the theorem ?

In a previous effort I asked for some clarifications to a distinguished scholar and I received this answer : "About the completeness proof, it is a theorem of orthodox mathematics, and does not pretend to be nominalistic."

## closed as unclear what you're asking by Joseph Weissman♦Jan 17 '16 at 22:29

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

• Can you frame the headline here as a question? I tried to and sort of got stuck, there's a lot going on here (it's maybe something about "minimizing ontological implications" of incompleteness?) -- I'm marking "unclear" for now – Joseph Weissman Jan 17 '16 at 22:29
• You may want to ask some questions about this on the mathematical form. As for the "syntactical stuff" argument, there are very specific requirements to invoke Godel's incompleteness theorem. The main one is omega-consistency, which is, in layman's terms, "the system can prove all true statements in the arithmetic of natural numbers." If it can do that, then it really doesn't matter what sort of clever tricks were done to obscure it (unless you do something really clever like Dan Willard's tricks to prohibit the construction of diagonalization) – Cort Ammon Jan 18 '16 at 2:41