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


Groups > sci.logic > #165283

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-18 21:41 -0400
Organization Aioe.org NNTP Server
Message-ID <8563dada-a979-5059-a2dd-233c05e65c4d@att.net> (permalink)
References (15 earlier) <7644b9ea-0a64-f81e-f7eb-1ca6978ae893@att.net> <a290a926-a21f-4afc-a3b1-9bfe82e5f563@googlegroups.com> <c05e4a49-9619-9ce6-faed-fdb553fd794a@att.net> <605b9d50-4180-7561-34b7-19eedb500369@att.net> <AcydnZgUEffdanrEnZ2dnUU7-XnNnZ2d@giganews.com>

Show all headers | View raw


On 10/18/2017 8:52 PM, mitch wrote:
> On 10/18/2017 07:11 PM, Jim Burns wrote:

>> What follows is my attempt to translate this:
>>     ∃X (X ⊢ Y) asserts that there is a set of connected WFF
>>     from X to Y.
>> into first-order predicate logic.
>>
>> Maybe it would be useful if I inserted English glosses for
>> the various definitions.
>>
>> On 10/18/2017 12:56 PM, Jim Burns wrote:
>>
>>> Provable(y)  @
>>>     Ex:( Proof(x) & y = last(x) )
>>
>> "y is provable" means
>>     there is some proof x that ends with y
> 
> If y is a finite string (I want to say well-formed
> formula, but ...) and x is a sequence of finite
> strings, then are you using a two-sorted logic?

Actually, I haven't settled yet what I'm doing in terms of
types or even what the formal system of concern is. Not yet.

There are at least two examples where there are both
finite sequences and items in those sequences, but only
one type: sets and arithmetic. It's obvious that sets
can do this, and Robinson arithmetic can use the Chinese
Remainder Theorem.

    (I may end up with a two-sorted logic, of sorts, anyway.
    But only because I want this earlier stage to be clearer.
    I need "numbers" of some kind for sequences (I guess?)
    and I need "sentences" and terms and symbols of some
    kind. It might be pedagogically more productive to just
    let all of that stuff be. (Or maybe not.))

When we look to the 1931 paper's Big List O' Definitions,
we see these four tools for manipulating finite sequences
(not with these names)

len(x) -- returns the number of items in list x

peek(k,x) -- returns the k_th item in list  x

join(x,y) -- returns the list that starts with the list x
             and then continues on to list y

single(x) -- returns the length-one list with that one time
            being x

----
I suspect that, given these four tools, we can
make recursive definitions in a non-recursive mode,
and describe many formal systems, including this
formal system (for some value of 'this'), provably
true-iff-not-provable sentences, and many interesting facts.

I _suspect_ that being able to construct these four tools
(or not) is the boundary between complete and boringly
inexpressive formal systems and incomplete but excitingly
expressive formal systems.

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