{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:39:14Z","timestamp":1649104754772},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,12,24]],"date-time":"2009-12-24T00:00:00Z","timestamp":1261612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00153-009-0172-0","type":"journal-article","created":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T19:19:51Z","timestamp":1261595991000},"page":"291-300","source":"Crossref","is-referenced-by-count":0,"title":["Provably recursive functions of constructive and relatively constructive theories"],"prefix":"10.1007","volume":"49","author":[{"given":"Morteza","family":"Moniri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,24]]},"reference":[{"key":"172_CR1","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.2307\/2695075","volume":"65","author":"J. Avigad","year":"2000","unstructured":"Avigad J.: Interpreting lassical theories in constructive ones. J. Symb. Log. 65, 1785\u20131812 (2000)","journal-title":"J. Symb. Log."},{"key":"172_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2178\/bsl\/1102022660","volume":"10","author":"J. Avigad","year":"2004","unstructured":"Avigad J.: Forcing in proof theory. Bull. Symb. Log. 10, 305\u2013333 (2004)","journal-title":"Bull. Symb. Log."},{"key":"172_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/malq.200310074","volume":"50","author":"S. Berardi","year":"2004","unstructured":"Berardi S.: A generalization of conservativity theorem for classical versus intuitionistic arithmetic. Math. Log. Q. 50, 41\u201346 (2004)","journal-title":"Math. Log. Q."},{"key":"172_CR4","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.2307\/2586698","volume":"63","author":"W. Burr","year":"2000","unstructured":"Burr W.: Fragments of Heyting arithmetic. J. Symb. Log. 63, 1223\u20131240 (2000)","journal-title":"J. Symb. Log."},{"key":"172_CR5","unstructured":"Buss, S.R.: Bounded Arithmetic, Bibliopolis (1986)."},{"key":"172_CR6","unstructured":"Buss, S.R.: The polynomial hierarchy and intuitionistic bounded arithmetic, Structure in complexity theory (Berkeley, Calif., 1986), 77\u2013103. Lecture Notes in Computer Science, 223, Springer, Berlin (1986)."},{"key":"172_CR7","first-page":"149","volume-title":"A Note on Bootstrapping Intuitionistic Bounded Arithmetic, Proof Theory (Leeds, 1990)","author":"S.R. Buss","year":"1992","unstructured":"Buss S.R.: A Note on Bootstrapping Intuitionistic Bounded Arithmetic, Proof Theory (Leeds, 1990), pp. 149\u2013169. Cambridge University Press, Cambridge (1992)"},{"key":"172_CR8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0960129599002844","volume":"9","author":"T. Coquand","year":"1999","unstructured":"Coquand T., Hofmann M.: A new method of establishing conservativity of classical systems over their intuitionistic version. Math. Struct. Comput. Sci. 9, 323\u2013333 (1999)","journal-title":"Math. Struct. Comput. Sci."},{"key":"172_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","volume":"63","author":"S.A. Cook","year":"1993","unstructured":"Cook S.A., Urquhart A.: Functional interpretations of feasibly constructive arithmetic. Ann. Pure Appl. Log. 63, 103\u2013200 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"172_CR10","doi-asserted-by":"crossref","first-page":"466","DOI":"10.2307\/2275282","volume":"57","author":"V. Harnik","year":"1992","unstructured":"Harnik V.: Provably total functions of intuitionistic bounded arithmetic. J. Symb. Log. 57, 466\u2013477 (1992)","journal-title":"J. Symb. Log."},{"key":"172_CR11","doi-asserted-by":"crossref","first-page":"682","DOI":"10.2307\/2274322","volume":"50","author":"D. Leivant","year":"1985","unstructured":"Leivant D.: Syntactic translations and provably total functions. J. Symb. Log. 50, 682\u2013688 (1985)","journal-title":"J. Symb. Log."},{"key":"172_CR12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1002\/malq.200310045","volume":"49","author":"M. Moniri","year":"2003","unstructured":"Moniri M.: On two questions about feasibly constructive arithmetic. Math. Log. Q. 49, 425\u2013427 (2003)","journal-title":"Math. Log. Q."},{"key":"172_CR13","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1093\/logcom\/13.6.881","volume":"13","author":"M. Moniri","year":"2003","unstructured":"Moniri M.: Comparing constructive arithmetical theories based on NP-PIND and coNP-PIND. J. Log. Comput. 13, 881\u2013888 (2003)","journal-title":"J. Log. Comput."},{"key":"172_CR14","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1093\/logcom\/exn003","volume":"18","author":"M. Moniri","year":"2008","unstructured":"Moniri M.: On the hierarchy of intuitionistic bounded arithmetic. J. Log. Comput. 18, 625\u2013630 (2008)","journal-title":"J. Log. Comput."},{"key":"172_CR15","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","volume":"36","author":"R. Parikh","year":"1971","unstructured":"Parikh R.: Existence and feasibility in arithmetic. J. Symb. Log. 36, 494\u2013508 (1971)","journal-title":"J. Symb. Log."},{"key":"172_CR16","volume-title":"Constructivism in Mathematics: An Introduction, vol. 1","author":"A.S. Troelstra","year":"1988","unstructured":"Troelstra A.S., van Dalen D.: Constructivism in Mathematics: An Introduction, vol. 1. North-Holland, Amsterdam (1988)"},{"key":"172_CR17","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"1996","unstructured":"Troelstra A.S., Schwichtenberg H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)"},{"key":"172_CR18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s001530050081","volume":"37","author":"K.F. Wehmeier","year":"1997","unstructured":"Wehmeier K.F.: Fragments of HA based on \u03a31-induction. Arch. Math. Log. 37, 37\u201349 (1997)","journal-title":"Arch. Math. Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0172-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-009-0172-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0172-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:36:43Z","timestamp":1558640203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-009-0172-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,24]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s00153-009-0172-0","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,24]]}}}