3.3 Operator controlled -derivations
Inference rules are formulated in one-sided sequent calculi.
Let
, and
.
We define a derivability relation ,
where
is a bound of ranks of cut formulas and of initial sequents .
The derivability relation is designed to do the following job.
An infinitary derivation in the relation arises from a finitary proof,
in which initial sequents occur to prove an axiom for stability,
cf.βLemma 3.19.
Inferences of are
removed by collapsing,
ranks of formulas in the derivations are lowered to ordinals less than , and
the initial sequents are replaced by inferences
by putting a cap on formulas to get a derivation
in another
derivability relation
, cf.βCapping 3.34 in
subsection 3.5.
Definition 3.13
holds
for a set
of formulas
if
|
|
|
(7) |
and one of the following cases holds
:
-
There exist
,
and an such that and
.
-
There exist
,
ordinals
for each such that
and
.
-
There exist and
such that
,
and
.
-
There exist
and a formula for a
, a and a
such that
,
and
.
- (stbl)
-
There exist a -formula
and a term
such that
and
.
Lemma 3.14
(Tautology)
holds for
.
Proof. By induction on .
Lemma 3.15
(Equality)
holds for .
Proof. By induction on , cf.[7, 4].
Lemma 3.16
(Inversion)
Let ,
and .
Then for each ,
holds.
Proof. By induction on .
Since , is not a major formula of any of (stbl).
Lemma 3.17
(Reduction)
Let and
for
with and .
Then
holds.
Proof. By induction on .
Since , is not a major formula of any (stbl).
If , then follows from a void
with a major formula in .
Let .
If , then a yields the lemma by .
Consider the case when the last inference in is a with the
major formula .
We have for and .
IH yields .
On the other hand we have
by Inversion 3.16.
Assuming , we obtain by (7), and
.
We obtain by Proposition 3.8.3, and
by a .
Lemma 3.18
(Cut-elimination)
Suppose
for .
Then holds.
Proof. By main induction on with subsidiary induction on .
Lemma 3.19
(Embedding of Axioms)
For each axiom in , there is an such that
holds.
Proof. We show that the axiom follows
by an inference .
Let be a -formula
and .
Then .
Let and .
We obtain
by a .
A yields
.
Lemma 3.20
(Embedding)
If for sets of sentences,
there are such that
holds.
Lemma 3.21
(Collapsing)
Assume
and
with .
Then
holds for and .
Proof. This is seen as in [7]
by induction on .
We have
by (7), and .
We obtain
for (7).
Case 1.
First consider the case when the last inference is a :
We have
a -formula
, and
a term
such that
by (7).
The assumption yields
, and
.
Case 2.
Second consider the case when the last inference is a on
:
There exist ordinals
and a formula
such that
,
and
.
Let .
IH yields
for
with
, where
and
.
On the other hand we have
by Inversion 3.16, and
.
Let
with
.
IH yields
.
A yields
for
.
When , IH followed by a
yields the lemma.
Case 3.
Third consider the case when the last inference is a
:
There exist and a -formula
such that ,
and
.
We obtain by Proposition 3.8.4.
IH yields
for with ,
and .
On the other, we obtain
by Inversion 3.16, and
.
Let with .
IH yields
.
We obtain
by a with .
Case 4.
Fourth consider the case when the last inference is a :
A -formula with
is introduced.
Let .
There are an , an ordinal
such that
.
We may assume .
We obtain
by (7),
.
IH yields
for with
.
follows from a .
Case 5.
Fifth consider the case when the last inference is a :
A formula with
is introduced in .
For every
there exists an
such that
.
We see as follows.
First by Proposition 3.12.1.
Second for example let . Then
by
, and . We obtain
.
Hence for .
IH yields
for each , where
with
.
We obtain
by a and .
3.5 Operator controlled derivations with caps
Our cut-elimination procedure goes roughly as follows, cf.βthe beginning of subsection 3.3.
The initial sequents in a given -derivation
are replaced by inferences
by putting a cap on formulas, cf.βCapping 3.34.
Our main task is to eliminate inferences from a resulting derivation .
Although a capped formula in Definition 3.25.1
is intended to denote the formula ,
we need to distinguish from .
The cap in is a temporary one, and the formula could
put on a smaller cap .
Let be an ordinal for which inferences
occur in .
In Recapping 3.35 the caps
are lowered by substituting a smaller
ordinal for , and simultaneously the ranks
of formulas to be reflected
are lowered.
In this process new inferences arise with ,
whose ranks might not be smaller.
Iterating this process,
we arrive at a derivation such that
every formula occurring in it is in .
Then caps play no rΓ΄le, i.e.,
is βequivalentβ to , and
inferences are removed from by replacing
these by a series of βs, cf.βLemmas 3.43 and 3.45.
See the beginning of subsection 3.6 for more on an elimination procedure.
In what follows strongly critical numbers
will be fixed, which are ordinals in Collapsing 3.21.
Also denotes a fixed ordinal.
Definition 3.25
-
1.
By a capped formula we mean a pair of -sentence
and an ordinal
such that
.
Such a pair is denoted by .
Sometimes it is convenient for us to regard uncapped formulas as capped formulas
with its cap .
A sequent is a finite set of capped or uncapped formulas, denoted by
,
where each formula in the set puts on the cap
.
When we write , we tacitly assume that
, where
.
A capped formula is said to be a -formula if
.
Let .
-
2.
Let be a strongly critical number.
A non-empty finite set of ordinals is said to be a finite family
(for ordinals ) if each is an ordinal
such that
is special,
, and
.
For a finite family
let
|
|
|
Definition 3.26
denotes the resolvent class defined by
iff
,
is a finite family,
,
and
,
where for finite functions .
We define another derivability relation
,
where
is a bound of ranks of cut formulas,
is a bound of ranks of minor formulas in inferences in a witnessed derivation.
The relation depends on ordinals , and
should be written as .
The ordinals will be fixed.
So let us omit these.
Note that if , then by
Proposition 3.12.3.
Definition 3.27
Let be a finite set of ordinals,
and
. Let
be
a finite family.
Let
a set of formulas
such that
for each .
holds
if
|
|
|
(8) |
|
|
|
(9) |
|
|
|
(10) |
and one of the following cases holds:
-
There exist
,
an ordinal
, with a cap , and an
and
.
-
There exist
, a cap ,
ordinals such that
and
for each .
-
There exist an ordinal and a capped formula
such that , ,
and
.
-
There exist ordinals
,
,
and a formula
for a and a
such that
and
for .
-
For , there exist a finite function ,
ordinals ,
,
a set of formulas such that
if ,
and a
finite set of uncapped formulas
enjoying the following conditions (r1), (r2), (r3), (r4) and (r5).
Let and
.
-
(r1)
,
and
.
-
(r2)
for the finite function , and
.
-
(r3)
For each ,
holds.
-
(r4)
: Then
holds for each .
-
(r5)
:
holds
for every such that
.
The case (r5) is said to be degenerated.
|
|
|
We see from (r1) that in
as well as
is a bound of ranks of
the formulas to be reflected.
The conditions (9) and (10)
ensure us (6) of Definition 2.21
in Lemma 3.35.
Note that the cap of cut formulas in inferences as well as the cap of minor formulas in , and
ordinals in inferences are restricted to the case .
Also note that the side formulas in the right upper sequents of a
has to be -formula, cf.βReduction 3.31.
In this subsection the ordinals
will be fixed, and
we write for .
Lemma 3.28
(Weakening)
Let
and
with
.
Then
holds.
Proof. By induction on . By the assumption ,
(9) is enjoyed.
In inferences , add the formula only to the left upper sequents .
Lemma 3.29
(Tautology)
Let ,
, and
be a finite family such that and
.
Let .
-
1.
holds.
-
2.
Assume ,
, and be an ordinal such that is a finite family,
and .
Then
holds for .
Proof. By induction on . We have
with .
We obtain
by Proposition 3.8.2 for (10).
In the proof let us write for .
3.29.1.
Let and .
Let .
We obtain
,
and .
IH yields
for .
A followed by a yields the lemma.
3.29.2.
We have .
We see
from .
Hence (10)
is enjoyed.
We have .
We obtain
by
Proposition 3.12.2 and .
Hence (9) is enjoyed.
Let or .
By Proposition 3.6 we obtain
or
.
Let .
We see
from .
Note that when , we have and .
For each , we have by Proposition 3.8.3.
On the other hand we have
by Proposition 3.12.3,
and .
IH yields
.
On the other hand we have
for any by Proposition 3.12.2.
We obtain
.
A followed by a yields
.
Lemma 3.30
(Inversion)
Let
,
, and
.
Then
holds.
Furthermore if ,
then
holds.
Proof. This is seen as in Inversion 3.16.
Since
is a -formula, is not
a -side formula in a right upper sequent of a .
We need to prune some branches at
since
such that
.
Lemma 3.31
(Reduction)
Let
for ,
and
,
where
,
, and
. Let
with , and
.
Then
holds.
Proof. By main induction on with subsidiary induction on .
Case 1. :
Then
follows
by a void with a major formula in .
In what follows assume .
Case 2. The last inference in
is a with a major formula :
We have
for an and an .
SIH yields
.
Assuming ,
we obtain by (9).
Hence
.
We obtain
by Inversion 3.30, and
for .
If , then a yields the lemma.
Let
with .
We obtain
by
(9).
This yields .
MIH then yields
for by and .
Case 3. The last inference in
is a :
Then .
We have an ordinal ,
sets and of capped formulas, and a set of uncapped formulas such that
, , ,
for each , and
holds for each .
SIH yields
for each .
We obtain
by a .
For each , we have .
follows by a series of βs.
Lemma 3.32
(Cut-elimination)
Let
with and
.
Then
holds.
Proof. By induction on . We may assume .
Consider the case when the last inference is a .
We have an and a -formula with such that
and .
IH yields
and
.
Let .
Then by (9).
We obtain
by
Reduction 3.31, where
.
Lemma 3.33
(Collapsing)
Let for .
Assume
and
with and .
Then
holds for and , where
.
Proof. By induction on .
Let , and .
We have
by (9).
The assumption yields .
On the other hand we have
by Proposition 3.10.6.
We obtain
by Proposition 3.10.7.
Hence (9) is enjoyed in
.
(10) is similarly seen from .
Case 1.
First consider the case when the last inference is a :
A formula with
is introduced in .
For every
there exists an
such that
.
We see from and
as in Collapsing 3.21.
Proposition 3.10.7 with then yields
for every .
Hence .
On the other hand we have
by Proposition 3.10.1.
Therefore IH yields
for every , where with .
We obtain
by a .
Case 2.
Second consider the case when the last inference is a :
Let .
There exist ordinals
and a formula
such that
,
and
.
As in Collapsing 3.21 we see from IH that
and
, where
,
,
,
and
.
A with the cap yields
.
Case 3.
Third consider the case when the last inference is a with :
We have sets and of formulas and such that
,
for each ,
and
for each .
IH with yields
for , and
.
Let with , and with .
On the other hand we have
by Inversion 3.30.
As in Case 1 we obtian
for .
IH yields
for , and .
We obtain
by a .
When , this follows from IH.
A yields .
Other case are seen from IH.
We have for each cut formula , and the case when the last inference is a is similar to Case 3.
Let us embed the derivability relation in .
Let be the fixed ordinal in Collapsing 3.21
with .
Lemma 3.34
(Capping)
Let be a strongly critical number
with .
Let
be a set of uncapped formulas.
Suppose
with .
Let
be an ordinal such that
, and
is a special finite function such that
with and
with
and
.
Let
be a finite family for ordinals .
Then
holds for and .
Proof. By induction on .
We have , ,
by (7).
We obtain .
Also
by the assumption.
We obtain by Proposition 3.12.3.
Hence
each of (8), (9) and (10) is enjoyed in
.
In the proof we write for .
Case 1.
First consider the case when the last inference is a :
We have
a -formula
, and
a term
such that
,
and .
We obtain
|
|
|
(11) |
by Tautology 3.29.1.
Let be a special finite function such that and
.
Then and
by .
Let with
.
We obtain and ,
cf.β(6).
We have for .
We have with .
Hence .
follows by Tautology 3.29.2.
A with yields
|
|
|
(12) |
An inference with
, (11) and (12)
yields
.
Case 2.
Second the last inference introduces
a -formula with :
There are an an ordinal
such that
.
Assume
.
We obtain
by , and hence
by (7),
and Proposition 2.28.
Hence .
IH yields .
follows from a .
Case 3.
Third the last inference introduces a -formula with
:
For every
there exists an
such that
.
IH yields
for each ,
where .
We obtain
by a .
Other cases
or are seen from IH.
Each uncapped cut formula as well as
formulas and in
puts on the cap with .
3.6 Reducing ranks
In this subsection, ranks in inferences
are lowered to in operator controlled derivations of -sentences
over .
Let be a derivation such that every formula occurring in it is in
.
We see in Lemma 3.43 that inferences
are removed from , where each capped formula
becomes the uncapped formula in Lemma 3.45.
To have for finite families ,
we break through the threshold in the sense that
.
We need the condition (10) to be enjoyed in Recapping 3.35.
Everything has to be done inside
except ordinals in until the rank is lowered to .
Our goal in this subsection is to transform derivations to .
For this is first transformed to a derivation in which
every capped formula is in .
Then Collapsing 3.33 yields
a derivation in rank less than .
Iterating this process, we arrive at a derivation .
In the following Recapping 3.35 we show that inferences
can be replaced by a series of βs.
Here caps are replaced by smaller caps
for
with an ordinal , and other inferences
are introduced for smaller ranks .
When , we obtain
for the formula to be reflected in inferences .
However it may be the case
for in the resolvent class of .
Therefore we need to replace inferences in higher ranks by a series of βs.
We have to iterate the replacement inside , and
an induction on must be avoided.
For the ordinals in Definition 3.36
we obtain
if ,
and we see from Proposition 3.24.1,
where is a replacement for and .
By induction on the ordinals we see in Lemma 3.37 that
the rank is lowered to .
This ends a rough sketch of the removals of inferences ,
and the details follow.
Lemma 3.35
(Recapping)
Suppose
, where , , ,
,
with ,
and
is a set of formulas such that for each .
Let be an ordinal
such that and
.
Assume that and
for .
Let
with
, and
.
Then
|
|
|
(13) |
holds, where .
Proof. By induction on .
We have and with .
Let
.
By Definition 3.26 we have
.
On the other hand we have
by , (9), (10) and the assumption.
Moreover if .
Otherwise , cf.βDefinition 3.25.2.
In each case we obtain .
Hence each of (9) and (10)
is enjoyed in (13).
Also by ,
Proposition 2.28 with .
Hence
, cf.β(6).
In the proof let us suppress the fourth and fifth subscripts, and we write
for
.
Case 1.
First consider the case when the last inference is a :
Then .
If , then (13) follows from IH.
In what follows assume .
Then .
We have
a finite set of formulas with
and an ordinal such that
|
|
|
for each .
Inversion 3.30 yields
|
|
|
(14) |
for each .
We have .
Then and .
On the other hand we have
|
|
|
(15) |
where , , and
.
We have for .
When , we have (15) for every such that .
is a finite function such that and
|
|
|
(16) |
Case 1.1. :
Let , and for .
We have , and
.
Let .
We obtain by
, and by .
Hence .
By IH with (14)
we obtain
.
A yields
|
|
|
(17) |
Let .
We claim that
|
|
|
(18) |
We have .
If , then and .
We obtain the claim by Proposition 2.5.
If , then the claim follows from Proposition 3.24.2.
Let .
Then by
, .
By IH with (15) we obtain for
|
|
|
(19) |
(13)
follows by an inference with
(18), (17) and (19).
If , then
the inference is degenerated, and it suffices to have (19) for ordinals with .
Case 1.2.
:
We obtain by
(9).
We have and .
Let , and
.
We have
by Definition 3.26.
We see
from .
As in Case 1.1, we obtain
by IH and (14).
Let .
Then for , we have
.
Hence (10) holds by adding the ordinal to , and we obtain
|
|
|
(20) |
We have
.
Hence .
We obtain by IH and (15)
|
|
|
(21) |
We have , and
with
by .
Reduction 3.31 with (20) and (21)
yields for
|
|
|
(22) |
for
by and .
On the other, Tautology 3.29.1 yields
for each
|
|
|
(23) |
For , we obtain
and
by Proposition 3.24.3.
By an inference rule
with
its resolvent class
,
we conclude (13) by (23), (22)
with
and .
Case 2.
Second consider the case when the last inference introduces a -formula
:
Let
with .
We have
,
where .
Assuming , we obtain
, i.e., by .
IH
yields
for .
We obtain (13)
by a .
Other cases are seen from IH.
Note that
for each capped cut formula , we have , and
for a minor formula of a ,
for .
These formulas put on the cap .
Also for .
Definition 3.36
For a finite family with and , let
|
|
|
Lemma 3.37
Let
, where , , and .
Assume
and
.
Then the following holds for and
|
|
|
(24) |
Proof. By main induction on with subsidiary induction on .
We have
by the assumption,
and
by (10).
We obtain for (10).
In the proof let us omit the fourth and fifth subscripts in .
Consider the case when the last inference is a with :
Let .
We have
a finite set of formulas with
and an ordinal such that
|
|
|
(25) |
for each .
is a finite function such that and
, and
.
SIH yields for
|
|
|
(26) |
On the other hand we have
|
|
|
(27) |
for every
with ,
, where
and .
If , then SIH yields for each
|
|
|
(28) |
We obtain (24) by a degenerated with (26) and (28).
Assume .
Let , where
.
Let with , and
for and
.
Then we see from and .
Hence
and
.
Recapping 3.35 with (27) yields
|
|
|
(29) |
where ,
, , and
.
We obtain
by Proposition 3.24.1.
MIH then yields
|
|
|
(30) |
where by and .
A degenerated
with (26) and (30)
yields (24).
Other cases are seen from SIH.
3.7 A third calculus
Combining Cut-elimination 3.32, Lemma 3.37 and Collapsing 3.33,
the rank of formulas in derivations is lowered to .
In other words, every formula occurring in derivations is in .
We are going to eliminate inferences and -formulas, and throw caps away.
In doing so, it is better to shift the calculus from in subsection 3.5 to a third one .
An uncapped formula is denoted by , and let for .
Let
for -terms and -formulas .
Also for sets of formulas.
Definition 3.38
Let be either or a finite family (for ),
a finite set of ordinals,
and .
Let
a set of formulas
such that
for each .
holds
if
|
|
|
(31) |
and one of the following cases holds:
-
There exist
,
an ordinal
, with a cap , and an
and
.
-
There exist
, a cap ,
ordinals such that
and
for each .
-
There exist , an ordinal and an uncapped -formula
such that ,
and
.
-
There exist ordinals
,
and a formula
such that
and
with .
Lemma 3.39
(Inversion)
Let
,
,
.
Then
holds.
Proof. This is seen as in Inversion 3.30.
Lemma 3.40
(Reduction)
Let
and
,
where
and .
Then
holds.
Proof. By induction on as in Reduction 3.31.
Consider the case when the last inference in
is a with a major formula :
We have
for an and an .
IH yields
.
We obtain
by Inversion 3.39, and
for and by (31).
We have .
A yields the lemma.
Lemma 3.41
(Cut-elimination)
Let
where , and
.
Then
holds.
Proof. By main induction on with subsidiary induction on using Reduction 3.40.
Lemma 3.42
Let
, where
, ,
for each , and .
Then
holds for
and for .
Proof. By induction on .
We obtain .
Let and .
If , then
holds by .
Let . Then when , and
.
Note that each cut formula as well as minor formulas of is a -formula
since .
Lemma 3.43
Let
with .
Then
holds for
and
, where
and .
Proof. By induction on .
We have (31) by (10).
In the proof let us write
for .
Case 1.
Consider first the case when the last inference is a :
We have
and
for , and .
IH yields
and
.
By Reduction 3.40 we obtain
for .
Case 2.
Second consider the case when the last inference is a degenerated :
We have , , ,
for each .
IH yields
|
|
|
(32) |
On the other hand we have
for and , where
ranges over ordinals such that
with , and
for each .
We have .
We have by Definition 3.25.2
and .
Furthermore
by (8).
Let for .
We see from .
Hence ,
and .
follows from IH, and by Lemma 3.42
|
|
|
(33) |
Let be the number of formulas in .
follows from (32), (33) and Reduction 3.40, where
by .
Other cases are seen from IH.
In with a minor formula and ,
we obtain by (9).
Definition 3.44
For sets of uncapped formulas,
let
|
|
|
for the empty family .
Lemma 3.45
(Uncapping)
Suppose
for ,
where
is a set of uncapped formulas,
,
and
.
Then
holds.
Proof. This is seen from Lemma 3.42.
Lemma 3.46
(Collapsing)
Assume
and
with .
Then
holds for and .
Proof. This is seen as in [7]
by induction on .
3.8 Proof of Theorem 1.3
Let us prove Theorem 1.3.
Let
for a -sentence .
By Lemma 3.20 pick an so that
.
Let .
Cut-elimination 3.18 yields
, where
.
Let and .
We obtain
by Collapsing 3.21.
In what follows each finite function is an with .
Let
with
with and .
Capping 3.34 yields
for .
In the following we write for , and
let for and .
We have
for ,
and .
We obtain
for
by Cut-elimination 3.32.
We have .
Let and .
Also let .
Recapping 3.35 then yields for ,
.
We obtain and
.
Let .
Lemma 3.37 yields
for .
Collapsing 3.33 yields
for
and .
Let , , , and
with
.
For , let ,
,
, , and
.
Also let
, and for .
We see inductively that , ,
,
and for each ,
.
We obtain
for .
Let .
By Lemma 3.43 we obtain
, where
and
for .
Uncapping 3.45 yields
.
In what follows we write for .
By Cut-elimination 3.41 we obtain
for .
Collapsing 3.46 then yields
for
with .
We finally obtain
by Cut-elimination 3.41.
We conclude
by induction up to .
Corollary 3.47
is
conservative over
with respect to -arithmetic sentences, and
each provably computable function in is defined
by -recursion for an .
Proof. Let be a -arithmetic sentence on , and assume
that proves .
Pick an such that .
Theorem 1.3 shows that is true.
The proof of Theorem 1.3 is seen to be formalizable in an intuitionistic fixed point theory
over an extension
of the first order arithmetic PA,
where transfinite induction schema
applied to arithmetical formulas with fixed point predicates is available
up to each in the extension .
From [1]
we see that is a conservative extension of .
Therefore .
Since the ordinal is an epsilon number,
we see that is provable in
.
Conversely we see that
proves
up to each
from Theorem 1.4 in [5].