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


Groups > sci.logic > #167558

Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups sci.logic
Subject Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF
Date 2017-11-28 03:24 +0000
Organization Aioe.org NNTP Server
Message-ID <87tvxfm6ft.fsf@bsb.me.uk> (permalink)
References <zNidnVks-PrvKojHnZ2dnUU7-anNnZ2d@giganews.com> <8be2bf32-3cb7-4fb0-bed7-faa23cd7e282@googlegroups.com> <44c7ccc1-54c1-468e-8345-9118e460a20b@googlegroups.com> <c943f0db-11a0-0692-b5db-b267c7de262f@att.net> <5ef17268-1b4b-4005-b55a-b8fc82e55775@googlegroups.com>

Show all headers | View raw


peteolcott <peterolcott2@gmail.com> writes:
<snip>
> The simplicity of lambda calculus syntax is apparent from a BNF
> specification of its concrete syntax:
> <expression> ::= <variable> ; lowercase identifiers 
> | <constant> ; predefined objects 
> | ( <expression> <expression> ) ; combinations 
> | ( λ <variable> . <expression> ) ; abstractions.

The problem with the simplest syntax is that you drown in parentheses.
Two useful conventions are that

  <exp1> <exp2> <exp3> ... <expn>

means

  (...((<exp1> <exp2>) <exp3>) ... <expn>)

and that

 λa . λb . λc . exp

means

 (λa . (λb . (λc . exp)))

(Obviously generalised to deeper nesting but that's hard to write with
. being the separator and ... indicating "and so on".)

When the two conventions meet, you resolve it by having application bind
more tightly than abstraction so

  λa . λb . + b a

means

  (λa . (λb . ((+ b) a)))

and not

  ((λa . (λb . +) b) a)

In short: application binds more tightly than abstraction with
application associating to the left and abstraction to the right.

-- 
Ben.

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


Thread

Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Rupert <rupertmccallum@yahoo.com> - 2017-11-25 23:58 -0800
  Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF peteolcott <peterolcott2@gmail.com> - 2017-11-27 07:54 -0800
    Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Jim Burns <james.g.burns@att.net> - 2017-11-27 12:19 -0500
      Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF peteolcott <peterolcott2@gmail.com> - 2017-11-27 18:14 -0800
        Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-11-28 03:24 +0000
        Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Jim Burns <james.g.burns@att.net> - 2017-11-28 11:17 -0500
    Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Peter Percival <peterxpercival@hotmail.com> - 2017-11-27 17:24 +0000
    Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Rupert <rupertmccallum@yahoo.com> - 2017-11-27 09:25 -0800
      Re: Kurt Gödel’s 1931 Incompleteness Theorem is only undecidable because it is not a closed WFF Rupert <rupertmccallum@yahoo.com> - 2017-11-28 09:08 -0800

csiph-web