Some Relations Between Subsystems of Arithmetic and Complexity of Computations

Publisher Website

1 January 1992

book chapter
Published by Springer Nature

p. 499-519
https://doi.org/10.1007/978-1-4612-2822-6_19

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

Bounded arithmetic and the polynomial hierarchy
Annals of Pure and Applied Logic, 1991
A note on bounded arithmetic
Fundamenta Mathematicae, 1990
Axiomatizations and conservation results for fragments of bounded arithmetic
Published by American Mathematical Society (AMS) ,1990
Quantified propositional calculi and fragments of bounded arithmetic
Mathematical Logic Quarterly, 1990
Proof Theory: Some Applications of Cut-Elimination
Published by Elsevier ,1977
Existence and feasibility in arithmetic
The Journal of Symbolic Logic, 1971
On the Interpretation of Non-Finitist Proofs--Part I
The Journal of Symbolic Logic, 1951