Abstract
In this paper we prove conservation theorems for theories of classical first-order arithmetic over their intuitionistic version. We also prove generalized conservation results for intuitionistic theories when certain weak forms of the principle of excluded middle are added to them. Members of two families of subsystems of Heyting arithmetic and Buss-Harnik’s theories of intuitionistic bounded arithmetic are the intuitionistic theories we consider. For the first group, we use a method described by Leivant based on the negative translation combined with a variant of Friedman’s translation. For the second group, we use Avigad’s forcing method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Avigad J.: Interpreting lassical theories in constructive ones. J. Symb. Log. 65, 1785–1812 (2000)
Avigad J.: Forcing in proof theory. Bull. Symb. Log. 10, 305–333 (2004)
Berardi S.: A generalization of conservativity theorem for classical versus intuitionistic arithmetic. Math. Log. Q. 50, 41–46 (2004)
Burr W.: Fragments of Heyting arithmetic. J. Symb. Log. 63, 1223–1240 (2000)
Buss, S.R.: Bounded Arithmetic, Bibliopolis (1986).
Buss, S.R.: The polynomial hierarchy and intuitionistic bounded arithmetic, Structure in complexity theory (Berkeley, Calif., 1986), 77–103. Lecture Notes in Computer Science, 223, Springer, Berlin (1986).
Buss S.R.: A Note on Bootstrapping Intuitionistic Bounded Arithmetic, Proof Theory (Leeds, 1990), pp. 149–169. Cambridge University Press, Cambridge (1992)
Coquand T., Hofmann M.: A new method of establishing conservativity of classical systems over their intuitionistic version. Math. Struct. Comput. Sci. 9, 323–333 (1999)
Cook S.A., Urquhart A.: Functional interpretations of feasibly constructive arithmetic. Ann. Pure Appl. Log. 63, 103–200 (1993)
Harnik V.: Provably total functions of intuitionistic bounded arithmetic. J. Symb. Log. 57, 466–477 (1992)
Leivant D.: Syntactic translations and provably total functions. J. Symb. Log. 50, 682–688 (1985)
Moniri M.: On two questions about feasibly constructive arithmetic. Math. Log. Q. 49, 425–427 (2003)
Moniri M.: Comparing constructive arithmetical theories based on NP-PIND and coNP-PIND. J. Log. Comput. 13, 881–888 (2003)
Moniri M.: On the hierarchy of intuitionistic bounded arithmetic. J. Log. Comput. 18, 625–630 (2008)
Parikh R.: Existence and feasibility in arithmetic. J. Symb. Log. 36, 494–508 (1971)
Troelstra A.S., van Dalen D.: Constructivism in Mathematics: An Introduction, vol. 1. North-Holland, Amsterdam (1988)
Troelstra A.S., Schwichtenberg H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)
Wehmeier K.F.: Fragments of HA based on Σ1-induction. Arch. Math. Log. 37, 37–49 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moniri, M. Provably recursive functions of constructive and relatively constructive theories. Arch. Math. Logic 49, 291–300 (2010). https://doi.org/10.1007/s00153-009-0172-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-009-0172-0
Keywords
- Intuitionistic bounded arithmetic
- Forcing
- Friedman’s translation
- Heyting arithmetic
- The negative translation