Re: Gödel's theorems in Wikipedia
- From: Aatu Koskensilta <aatu.koskensilta@xxxxxxxxx>
- Date: Thu, 23 Jun 2005 16:04:06 +0300
David C. Ullrich wrote:
On 22 Jun 2005 15:53:56 -0700, ps218@xxxxxxxxx wrote:
Very nicely done! A question arising: what's the nicest reference for a proof of "first order arithmetic (Peano arithmetic or PA for short) can prove that the largest consistent subset of PA is consistent."?
That can't be the question you meant to ask - it doesn't require PA to prove that "the largest consistent subset of PA is consistent".
(First, the question seems to assume that any theory has a largest consistent subset, which is not so. Second, if a theory
does have a largest consistent subset then that subset is
consistent just by definition.)
The largest consistent subset of PA is defined with reference to a Gödel numering. Specifically, order the axioms of PA according to their Gödel numbers and take the largest initial segment of these axioms which does not lead to contradiction. Since PA is in fact consistent, this segment will in fact contain all of the axioms, but PA can't prove this.
-- Aatu Koskensilta (aatu.koskensilta@xxxxxxxxx)
"Wovon man nicht sprechen kann, daruber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus .
- Follow-Ups:
- Re: Gödel's theorems in Wikipedia
- From: David C . Ullrich
- Re: Gödel's theorems in Wikipedia
- References:
- Gödel's theorems in Wikipedia
- From: Aatu Koskensilta
- re: Gödel's theorems in Wikipedia
- From: Acme Diagnostics
- Re: Gödel's theorems in Wikipedia
- From: ps218
- Re: Gödel's theorems in Wikipedia
- From: David C . Ullrich
- Gödel's theorems in Wikipedia
- Prev by Date: Re: Comparing times in FOPC
- Next by Date: Re: Gödel's theorems in Wikipedia
- Previous by thread: Re: Gödel's theorems in Wikipedia
- Next by thread: Re: Gödel's theorems in Wikipedia
- Index(es):
Relevant Pages
|
|