
Abstract
In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke-Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω -rule.