Re: Provable in T?
- From: "MoeBlee" <jazzmobe@xxxxxxxxxxx>
- Date: 21 Aug 2006 15:07:22 -0700
Aatu Koskensilta wrote:
MoeBlee wrote:
Okay, that's one point I've always wondered about. But what is, in a
sense, the weakest theory to which the first incompleteness theorem
applies? Is it again ISigma_1 arithmetic? (That's the question I really
meant.)
The first incompleteness theorem applies to much weaker theories,
including Robinson arithmetic. I don't think there is any theory that is
in any sense the weakest to which the first incompleteness theorem
applies, but of the natural theories Robinson arithmetic or one of its
variants would probably come close.
Good, thanks, that's what I wanted to know.
MoeBlee
.
- References:
- Re: Provable in T?
- From: Newberry
- Re: Provable in T?
- From: Aatu Koskensilta
- Re: Provable in T?
- From: Newberry
- Re: Provable in T?
- From: Rupert
- Re: Provable in T?
- From: george
- Re: Provable in T?
- From: Rupert
- Re: Provable in T?
- From: george
- Re: Provable in T?
- From: Rupert
- Re: Provable in T?
- From: george
- Re: Provable in T?
- From: Rupert
- Re: Provable in T?
- From: MoeBlee
- Re: Provable in T?
- From: Aatu Koskensilta
- Re: Provable in T?
- From: MoeBlee
- Re: Provable in T?
- From: Aatu Koskensilta
- Re: Provable in T?
- From: MoeBlee
- Re: Provable in T?
- From: Aatu Koskensilta
- Re: Provable in T?
- Prev by Date: Re: A question about FOL theories and models
- Next by Date: Re: A question about FOL theories and models
- Previous by thread: Re: Provable in T?
- Next by thread: Re: Provable in T?
- Index(es):