Abstract
No counter-example interpretation for bounded arithmetic is employed to derive recent witnessing theorem for S i+12 , functions □ P i+1 −computable with counterexamples are shown to include all □ P i+2 −functions, and two separation results for fragments of S 2(α) are proved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Buss, Bounded Arithmetic, Bibliopolis, Naples, 1986.
S. Buss, Axiomatization and conservation results for fragments of hounded arithmetic, Proc. Workshop in Logic and Computation, Contemporary Mathematics AMS (to appear).
J. Krajíček, P. Pudlak and G. Takeuti, Bounded arithmetic and the polynomial hierarchy, Annals of Pure and Applied Logic (to appear).
J. Krajíček and G. Takeuti, On induction-free provability, Discrete Applied Mathematics (to appear).
J. Paris, A. Wilkie and A. Woods, Provability of the pigeon-hole principle and the existence of infinitely many primes, Journal of Symbolic Logic 53 no. 4 (1988), 1235–1244.
P. Pudläk, Some relations between subsystems of arithmetic and complexity of computations, this volume.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag New York, Inc
About this paper
Cite this paper
Krajíček, J. (1992). No Counter-Example Interpretation and Interactive Computation. In: Moschovakis, Y.N. (eds) Logic from Computer Science. Mathematical Sciences Research Institute Publications, vol 21. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2822-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2822-6_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7685-2
Online ISBN: 978-1-4612-2822-6
eBook Packages: Springer Book Archive