Results 1 
1 of
1
A Logical Calculus for Polynomialtime Realizability
 Journal of Methods of Logic in Computer Science
, 1991
"... A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomialtime realizability as defined by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0 Introduct ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomialtime realizability as defined by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0 Introduction In [4], a restricted notion of realizability is introduced, a special case of which is polynomialtime realizability: this is like Kleene's original realizability, save for three features. First, closed atomic formulae are realized by realizers that give a measure of the resources required to establish the formula, unlike Kleene's system which only reflects the fact that the formula is provable. Second, open formulae are treated as the corresponding closed formulae with all free variables universally quantified simultaneously. (There is a difference between the quantifiers 8h¸; ji and 8¸8j.) And third, the realizers code polynomialtime ("ptime") functions, rather than arbitrary recurs...