4 research outputs found
Consistency proof of a fragment of PV with substitution in bounded arithmetic
This paper presents proof that Buss's can prove the consistency of a
fragment of Cook and Urquhart's from which induction has been
removed but substitution has been retained.
This result improves Beckmann's result, which proves the consistency of such
a system without substitution in bounded arithmetic .
Our proof relies on the notion of "computation" of the terms of
.
In our work, we first prove that, in the system under consideration, if an
equation is proved and either its left- or right-hand side is computed, then
there is a corresponding computation for its right- or left-hand side,
respectively.
By carefully computing the bound of the size of the computation, the proof of
this theorem inside a bounded arithmetic is obtained, from which the
consistency of the system is readily proven.
This result apparently implies the separation of bounded arithmetic because
Buss and Ignjatovi\'c stated that it is not possible to prove the consistency
of a fragment of without induction but with substitution in
Buss's .
However, their proof actually shows that it is not possible to prove the
consistency of the system, which is obtained by the addition of propositional
logic and other axioms to a system such as ours.
On the other hand, the system that we have considered is strictly equational,
which is a property on which our proof relies.Comment: Submitted versio
Bounded Arithmetic in Free Logic
One of the central open questions in bounded arithmetic is whether Buss'
hierarchy of theories of bounded arithmetic collapses or not. In this paper, we
reformulate Buss' theories using free logic and conjecture that such theories
are easier to handle. To show this, we first prove that Buss' theories prove
consistencies of induction-free fragments of our theories whose formulae have
bounded complexity. Next, we prove that although our theories are based on an
apparently weaker logic, we can interpret theories in Buss' hierarchy by our
theories using a simple translation. Finally, we investigate finitistic G\"odel
sentences in our systems in the hope of proving that a theory in a lower level
of Buss' hierarchy cannot prove consistency of induction-free fragments of our
theories whose formulae have higher complexity