Re: What does G?del's Incompleteness mean for the Working Mathematician?

From: pa@xxxxxxxxxxxxxxxxxxxxx (Pierre Asselin)
Date: Sat, 27 Aug 2005 00:05:26 +0000 (UTC)

In sci.logic Timothy Murphy <tim@xxxxxxxxxxxxxxxxxxxxxx> wrote:

> Surely it is normal usage to say that theorems in a formal system
> are true?

Nope.

(Or rather: yes, but only when they really are true.)

--
pa at panix dot com
.

Follow-Ups:
- Re: What does G?del's Incompleteness mean for the Working Mathematician?
  - From: Timothy Murphy

References:
- What does Gödel's Incompleteness mean for the Working Mathematician?
  - From: Bob Stewart

Prev by Date: What should an int() function do?
Next by Date: Re: 0.999... = 1? (I know, a beaten dead horse)
Previous by thread: Re: What does Gödel's Incompleteness mean for the Working Mathematician?
Next by thread: Re: What does G?del's Incompleteness mean for the Working Mathematician?
Index(es):
- Date
- Thread

Relevant Pages

=?iso-8859-1?q?Re:_What_does_G=F6dels_Incompleteness_mean_for_the_Working_Mathematician=3F?=
... for the sentences that all the theorems satisfy. ... |It's not normal usage to say "formal system" ... formal system are a subset of that set of truths. ...
(sci.logic)
=?iso-8859-1?q?Re:_What_does_G=F6dels_Incompleteness_mean_for_the_Working_Mathematician=3F?=
... Timothy Murphy wrote: ... > that theorems in a formal system ... It's not normal usage to say "formal system" ...
(sci.logic)
Re: What does G?dels Incompleteness mean for the Working Mathematician?
... Pierre Asselin wrote: ... >> Surely it is normal usage to say that theorems in a formal system ...
(sci.math)
Re: What sci.logic is like
... GC is provable in any formal system that has theorems of Q but doesn't ... as formalized some statements about certain unknownability). ... In the current FOL reasoning framework, it's impossible to prove, ...
(sci.logic)
Re: Question about first-order arithmetic
... there exist theorems of ZF which can be ... a properly axiomatized formal system whose axioms can use the language ... (just recursively enumerate the ZF-theorems, ... By Craig's Theorem there is a primitive recursive axiomatization of any ...
(sci.logic)