Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #164882

Re: The simplest possible form of the 1931 Incompleteness Theorem:

From Jim Burns <james.g.burns@att.net>
Newsgroups sci.logic
Subject Re: The simplest possible form of the 1931 Incompleteness Theorem:
Date 2017-10-12 21:24 -0400
Organization Aioe.org NNTP Server
Message-ID <7972a1a1-bf76-c729-da02-1692f632e180@att.net> (permalink)
References (10 earlier) <63c4ccef-222a-4d9e-a43a-8bf74666a257@googlegroups.com> <1afcb5c2-ec36-15af-368c-00be093ba3b4@att.net> <10935fc8-c5a1-4f61-8b76-77c3a15a06ca@googlegroups.com> <444d0064-1f0d-5f43-7588-a6d50d660b92@att.net> <9826ee00-6f84-4136-92a1-1cdc87d6e30d@googlegroups.com>

Show all headers | View raw


On 10/12/2017 8:12 PM, peteolcott wrote:
> On Thursday, October 12, 2017 at 6:18:41 PM UTC-5,
> Jim Burns wrote:

>> Suppose that a formal system is able to express "there is
>> a proof of the given formula D" as some formula Prov(D).
>> Then it can express a sentence G such that only these
>> options are possible:
>>      (i)  G is true  and G is not provable.
>>      (ii) G is false and G is provable (provable true).
>> In case (i),  the formal system is incomplete.
>> In case (ii), the formal system is inconsistent.
> 
> Lets try to formalize that.
> 
> I am not sure that you ever understood this:
> The Alias_Operator @ provides the means for an expression
> to refer directly to itself and thus not indirectly
> to its name.
> 
> (i)  G @ True(G)  &  Provable(G)
> (ii) G @ False(G) & ~Provable(G)
> 
> Is this what you mean ?

No, G does not refer to either of those.

And, before we lose the context, the proof is that
(i) OR (ii) is true.

Also, the way we say some sentence G is true in FPOL is:
    G
and the way we say G is false is
    ~G

Using True(G) and False(G) instead suggests to me that
True(X) is to stand for some formula in the formal language
we are using which evaluates X, and for which True(X) has
the same truth value as X, for all X.
   (Tarski proved that, for a wide range of formal systems,
    there wasn't such a formula.)
And similarly for False(X).

That's not what I mean. Not 'True(G)', just 'G'. Could we write
G and ~G when we mean true and false for G? I think I would
find it distracting-to-confusing to introduce this notation.

The thing that is proved is that, for some sentence G,

    ( G & ~Prov(G) )  OR  ( ~G & Prov(G) )

We prove that, pretty much completely, with the diagonal
lemma.

----
The interesting part of the proof is the actual statement of
that sentence, in the original un-extended language. What we
see is an abbreviation of that very long, very complex sentence
-- which is basically unreadable by humans, but which is what
actually gets proved.

We get the actual statement by backing down that list of
46 definitions, replacing
    Provable(y)          "y is provable'
with
    Ex: IsProofOf(x,y)   "There is a proof x of y"

and then IsProofOf() with the definition of IsProofOf,
followed by the defined terms in that definition, dot-dot-dot.
Eventually, all the defined terms are gone.

----
The point of the First Incompletness Theorem is that we prove
that there is some statement _in the original unextended language_
of our formal system which is true if and only if it is
not provable in that formal system. We _abbreviate_ that
unwieldy sentence as G, but we are talking about the
unabbreviated sentence.

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 10:01 -0700
  Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 10:36 -0700
  Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-11 21:59 +0100
    Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-11 18:29 -0500
      Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 00:52 +0100
        Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-11 19:15 -0500
          Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 02:02 +0100
            Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 18:50 -0700
              Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 11:28 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 06:37 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 11:52 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 12:44 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 18:08 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 15:25 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 19:18 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:12 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 21:24 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-13 08:31 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-13 17:07 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-17 08:38 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-17 14:51 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-17 07:08 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-17 20:49 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 08:54 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-18 17:28 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 18:41 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:49 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 11:51 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-20 07:17 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 15:45 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-20 13:09 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 12:56 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 20:11 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 19:52 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-18 21:41 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 21:44 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-19 18:26 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-19 17:39 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 11:38 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-20 07:18 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Peter Percival <peterxpercival@hotmail.com> - 2017-10-20 16:10 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 19:12 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 22:32 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:54 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-18 18:47 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-18 19:31 -0500
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-12 19:59 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:40 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-13 01:46 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-12 17:55 -0700
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Jim Burns <james.g.burns@att.net> - 2017-10-12 21:40 -0400
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-13 12:26 +0100
                Re: The simplest possible form of the 1931 Incompleteness Theorem: Pete Olcott <Pete@NoEmail.address> - 2017-10-23 15:10 -0500
    Re: The simplest possible form of the 1931 Incompleteness Theorem: Charlie-Boo <shymathguy@gmail.com> - 2017-10-24 10:36 -0700
      Re: The simplest possible form of the 1931 Incompleteness Theorem: mitch <mitch@dev.null> - 2017-10-24 15:02 -0500
  Re: The simplest possible form of the 1931 Incompleteness Theorem: William Elliot <marsh@panix.com> - 2017-10-11 21:16 -0700
    Re: The simplest possible form of the 1931 Incompleteness Theorem: peteolcott <peterolcott2@gmail.com> - 2017-10-11 21:59 -0700
      Re: The simplest possible form of the 1931 Incompleteness Theorem: William Elliot <marsh@panix.com> - 2017-10-12 19:44 -0700
  Re: The simplest possible form of the 1931 Incompleteness Theorem: Charlie-Boo <shymathguy@gmail.com> - 2017-10-24 10:34 -0700

csiph-web