Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: Scott <ToaTerra@xxxxxxxxx>
- Date: Thu, 14 Aug 2008 13:33:22 -0700 (PDT)
On Aug 13, 2:52 pm, Chris Menzel <cmen...@xxxxxxxxxxxxxxxxxxxx> wrote:
uninteresting, and implies nothing about the completeness of first-order
theories generally. The question of completeness is interesting only
If the undecidable proposition is derivable in FOL, it should be
derivable in any theory. Doesn't this make any theory incomplete? If
not, how does a theory prevent the derivation?
.
- Follow-Ups:
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: MoeBlee
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: herbzet
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: Chris Menzel
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- References:
- Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: Scott
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: MoeBlee
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: Scott
- Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- From: Chris Menzel
- Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- Prev by Date: Re: The nature of the mathematical set
- Next by Date: Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- Previous by thread: Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- Next by thread: Re: Looking for Undecidable Propositions in Systems without a certain amount of arthimetic.
- Index(es):
Relevant Pages
|