Summary
We prove some independence results for the bounded arithmetic theoryR 02 , and we define a class of functions that is shown to be an upper bound for the class of functions definable by a certain restricted class of ∑ b1 in extensions ofR 02 .
Similar content being viewed by others
References
Buss, S.R.: Bounded Arithmetic. Napoli: Bibliopolis 1986
Clote, P., Takeuti, G.: First order bounded arithmetic and small boolean circuit complexity classes. To appear
Clote, P., Takeuti, G.: Bounded arithmetic forNC, ALogTIME, L andNL. Ann. Pure Appl. Logic56, 73–117 (1992)
Johannsen, J.: On the weakness of sharply bounded polynomial induction. In: Gottlob, G., et al. (eds) Computational Logic and Proof Theory (Lect. Notes Comput. Sci., vol. 713, pp. 223–230) Berlin Heidelberg New York: Springer 1993
Takeuti, G.: Sharply bounded arithmetic and the functiona ∸ 1. Contemp. Math.106, 281–288 (1990)
Takeuti, G.:RSUV isomorphisms. In: Clote, P., Krajíček, J. (eds) Arithmetic, Proof Theory and Computational Complexity (Oxf. Logic Guides, vol. 23, pp. 364–386). Oxford: Clarendon Press 1993
Author information
Authors and Affiliations
Additional information
Mathematics subject classification: 03F30
This article was processed by the author using the LATEX style filepljour1 from Spinger-Verlag.
Rights and permissions
About this article
Cite this article
Johannsen, J. A note on sharply bounded arithmetic. Arch Math Logic 33, 159–165 (1994). https://doi.org/10.1007/BF01352935
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01352935