Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #168276

Re: Super-consistency

From "Shobe, Martin" <martin.shobe@yahoo.com>
Newsgroups sci.logic
Subject Re: Super-consistency
Date 2017-12-16 07:50 -0600
Organization A noiseless patient Spider
Message-ID <p138bg$2j7$1@dont-email.me> (permalink)
References <81d2877d-9ace-4d80-b549-dd904ce285ce@googlegroups.com> <2bee208b-a8b2-4fc1-a5a1-004a61eeae54@googlegroups.com> <3ede7f19-409b-4ff6-b144-a6d61d394afb@googlegroups.com>

Show all headers | View raw


On 12/16/2017 6:08 AM, Zuhair wrote:
> On Saturday, December 16, 2017 at 1:44:57 PM UTC+3, Rupert wrote:
>> On Saturday, December 16, 2017 at 7:55:46 AM UTC+1, Zuhair wrote:
>>> Lets define "super-consistency" as:
>>>
>>> T_0 = T
>>> T_i+1 = T_i + Con(T_i)
>>> T_j = U{T_i| i<j}
>>>
>>> Where i is a countable ordinal
>>>
>>> Define: T is super-consistent <=df=> For all i: Con(T_i)
>>>
>>> Does these statements follow?
>>>
>>> 1. If T,H are super-consistent -> T Union H is super-consistent?
>>> 2. If T is super-consistent ^ G fragment of T -> G is super-consistent?
>>> 3. Does the above recursive definition of T_i necessarily stop at Church-Kleene ordinal?
>>> 4. Can we have a theory that is super-consistent and yet FALSE?
>>>
>>>
>>> Zuhair
>>
>> This question was studied by Turing in his article about ordinal logics, I can get the exact citation for you if you like. There is an issue about defining the sentence Con(T_i), this sentence will depend on which description you give of the ordinal. You can have different descriptions of two ordinals of the same ordertype and the corresponding consistency sentences will not necessarily be equivalent. So it's not a well-ordered sequence of ordinals, but rather a well-founded tree of notations for recursive ordinals, at the limit levels of the tree one has branching. Given any Pi^0_1-sentence whatsoever, there is some description of an ordinal of order-type omega+1, such that the corresponding Con(T_i) will imply the Pi^0_1-sentence in question. So in this sense you have Pi^0_1-completeness, but only of a trivial kind. You're also only going to be able to make sense of this for the recursive ordinals, if you go to the first non-recursive ordinal then you won't be able to get a correspondence sentence Con(T_i) in the first-order language of arithmetic. This is all part of a well-developed part of proof theory called ordinal analysis where each theory has its own proof-theoretical ordinal, the supremum of all the ordinals which can be proved to be well-founded in the theory in question.
>>
>> Your notion of "super-consistency", if we assume you are quantifying over all recursive ordinals, is not definable in the first-order language of arithmetic, but it is definable in the second-order language of arithmetic.
>>
>> The answer to question (1) is no as can be seen from the examples T=PA+Con(PA), H=PA+~Con(PA). T is super-consistent because it is sound and H can be proved to be super-consistent by transfinite induction: PA+~Con(PA) is equiconsistent with PA, PA+Con(PA+~Con(PA)) is equiconsistent with PA+Con(PA), and so on, you end up with a transfinite sequence of theories each one of which is equiconsistent with one of the theories in the sequence generated by T. (I should say "tree" rather than "sequence", of course, but you get the idea.)
>   
> H_0 = PA+~Con(PA)
> H_1= PA+~Con(PA) + Con(PA+~Con(PA))
> ..
> ..
> 
> I thought that H_1 is INCONSISTENT.
> Proof: if PA is inconsistent, then H_0 is inconsistent.
> If PA is consistent then we have:
> H_1 |- ~Con(PA)
> H_1 |-  Con(PA)

> the reason for the last is is that Con(PA+~Con(PA)) is an axiom of H_1
> since PA is a fragment of H_0, then if H_0 (which is PA+~Con(PA)) is consistent then all fragments of it must be consistent, and so PA would be provably consistent!

You could simplify that to if H_1 is consistent, then PA, being a 
fragment of H_1 would also be consistent. This doesn't mean that H_1 |- 
Con(PA).

Martin Shobe

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-15 22:55 -0800
  Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-16 02:44 -0800
    Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-16 04:08 -0800
      Re: Super-consistency "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-12-16 07:50 -0600
        Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-16 06:23 -0800
          Re: Super-consistency "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-12-16 20:52 -0600
            Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-17 03:28 -0800
              Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-17 04:07 -0800
                Re: Super-consistency "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-12-17 14:18 -0600
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-17 19:04 -0800
                Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-17 22:08 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 03:46 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 04:48 -0800
                Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-18 05:13 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 05:26 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 05:59 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 10:14 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 10:16 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 10:23 -0800
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 11:29 -0800
                Re: Super-consistency "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-12-19 22:42 -0600
                Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 05:35 -0800
            Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-18 04:40 -0800
    Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-16 04:27 -0800
      Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-16 06:04 -0800
    Re: Super-consistency Peter Percival <peterxpercival@hotmail.com> - 2017-12-16 13:10 +0000
    Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-17 03:42 -0800
      Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-17 04:09 -0800
      Re: Super-consistency Rupert <rupertmccallum@yahoo.com> - 2017-12-17 04:11 -0800
    Re: Super-consistency Zuhair <zaljohar@gmail.com> - 2017-12-19 11:02 -0800

csiph-web