Re: FOL, ZFC, NGB and Prolog
- From: "galathaea" <galathaea@xxxxxxxxx>
- Date: 9 Jun 2005 13:04:48 -0700
tom wrote:
(I thought Goedel equated provability and truth).
to which aatu koskensita responded:
Quite the opposite, really, provided we're speaking about formal
provability.
that is not quite true
goedel, like many mathematicians of the time, struggled with the
definition of truth
and at times he did study the "truth as proof" school
but his conceptions of its meaning was not a necessary component to his
major arguments in metamathematics
however, the constructivists of the time equated truth and provability
and this later was incorporated into the foundations of computation
which express the incompleteness theorems much more directly
the key concept is inaccesibility
(or the dual notion of platonic truth)
to tom:
if you are truly interested in the connections between computation and
proof theory
start with the curry-howard isomorphism
it is the centerpiece on which the connection is made formal
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
galathaea: prankster, fablist magician, liar
.
- Follow-Ups:
- Re: FOL, ZFC, NGB and Prolog
- From: Keith Ramsay
- Re: FOL, ZFC, NGB and Prolog
- From: Aatu Koskensilta
- Re: FOL, ZFC, NGB and Prolog
- From: Tom
- Re: FOL, ZFC, NGB and Prolog
- References:
- FOL, ZFC, NGB and Prolog
- From: Tom
- Re: FOL, ZFC, NGB and Prolog
- From: Jim Spriggs
- Re: FOL, ZFC, NGB and Prolog
- From: Tom
- Re: FOL, ZFC, NGB and Prolog
- From: Jim Spriggs
- Re: FOL, ZFC, NGB and Prolog
- From: Tom
- Re: FOL, ZFC, NGB and Prolog
- From: Aatu Koskensilta
- FOL, ZFC, NGB and Prolog
- Prev by Date: Re: Question...
- Next by Date: Re: Penrose's Computing Pi Description?
- Previous by thread: Re: FOL, ZFC, NGB and Prolog
- Next by thread: Re: FOL, ZFC, NGB and Prolog
- Index(es):
Relevant Pages
|