Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| 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-13 17:07 -0400 |
| Organization | Aioe.org NNTP Server |
| Message-ID | <22af3d64-d635-27cd-c3aa-a07ef9e6be8b@att.net> (permalink) |
| References | (12 earlier) <10935fc8-c5a1-4f61-8b76-77c3a15a06ca@googlegroups.com> <444d0064-1f0d-5f43-7588-a6d50d660b92@att.net> <9826ee00-6f84-4136-92a1-1cdc87d6e30d@googlegroups.com> <7972a1a1-bf76-c729-da02-1692f632e180@att.net> <64350daa-5b6a-471b-bf7d-f06fd08e0d59@googlegroups.com> |
On 10/13/2017 11:31 AM, peteolcott wrote:
> On Thursday, October 12, 2017 at 8:24:42 PM UTC-5,
> Jim Burns wrote:
>> 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) )
>
> http://liarparadox.org/index.php/2017/06/10/602/
> ∃X (X ⊢ Y) asserts that there is a set of connected WFF
> from X to Y.
Provable(y) @ Ex: IsProofOf(x,y)
IsProofOf(x,y) @ ProofSeq(x) & IsLastOf(y,x)
IsLastOf(y,x) @ y = peek(len(x),x)
ProofSeq(x) @
En > 1: n = len(x) &
Ak: 1 =< k =< n ->
Axiom( peek(k,x) ) \/
Ei:Ej: 1=< i < k & 1 =< j < k &
Rule( peek(i,x), peek(j,x), peek(k,x) )
-- len(x) returns the number of items in the finite sequence x
of items
-- peek(k,x) returns the k_th item of the finite sequence x
of items
-- Axiom(x) is true if x is an axiom of the formal system
-- Rule(x,y,z) is true if z follows from x and y by one of
the rules of inference of the formal system
Since the formal language will get specified in order to define
Axiom() and Rule(), we have language, axioms and rules specified,
which describes the formal system for which Provable() is
correct.
This is how I would say formally that
"Provable(y) asserts that y is provable"
-- with more detail.
> If G is an alias (sentential variable) for ∃X (X ⊢ Y),
> then G is either True or False, even if both X and Y are
> gibberish.
>
> If G is an alias (sentential variable) for ~∃X (X ⊢ G)
> we have pathological self-reference creating infinite
> recursion.
In the 1931 paper, G is not an alias for anything.
Any cycles you introduce are your own problem, and not
Goedel's.
People occasionally work out the precise sentence of arithmetic
that is proven to be true if and only if it is provable and
the precise natural number that represents that statement.
They take pages to write down and do not add any clarity to
the argument, but they exist and can be written down.
> copyright 2017 Pete Olcott
Thank you for NOT copywriting my words.
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll 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