S. Buss, "The polynomial time hierarchy and intuitionistic bounded arithmetic", pp. 77 -- 103 in Structure in Complexity Theory, 1986, (Springer Lecture Notes in Computer Science 223, A.L. Selman, ed.) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graded Multicategories of Polynomial-time Realizers (Extended.. - Seely (Correct)
....definition. One final point: for simplicity, in this note we shall not consider the structure of the natural numbers, and so shall make no reference to the non logical axioms needed to describe that structure. Of course, this is a serious oversight, but that structure (essentially Buss s axioms ([1, 2], see also [3] together with the expected equality axioms) is discussed in [5] as well as in [11] mutatis mutandis. 1 Polynomial time realizers We recall the basic definitions from [4] and [5] for full details, the reader should refer to those papers. 1.1 Realizers We assume a formal ....
S. Buss, "The polynomial time hierarchy and intuitionistic bounded arithmetic", Proceedings of the First Symposium on Structures and Complexity, 1986, (IEEE Publications).
A Logical Calculus for Polynomial-time Realizability - Crossley, Mathai, Seely (1991) (Correct)
No context found.
S. Buss, "The polynomial time hierarchy and intuitionistic bounded arithmetic", pp. 77 -- 103 in Structure in Complexity Theory, 1986, (Springer Lecture Notes in Computer Science 223, A.L. Selman, ed.)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC