- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Provably total functions of intuitionistic bounded arithmetic
Journal of Symbolic Logic 57 (2):466-477 (1992)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Extracting Algorithms from Intuitionistic Proofs.Fernando Ferreira & António Marques - 1998 - Mathematical Logic Quarterly 44 (2):143-160.
Two General Results on Intuitionistic Bounded Theories.Fernando Ferreira - 1999 - Mathematical Logic Quarterly 45 (3):399-407.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic.Mohammad Ardeshir, Erfan Khaniki & Mohsen Shahriari - 2019 - Notre Dame Journal of Formal Logic 60 (3):481-489.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Analytics
Added to PP
2009-01-28
Downloads
35 (#444,209)
6 months
10 (#383,927)
2009-01-28
Downloads
35 (#444,209)
6 months
10 (#383,927)
Historical graph of downloads
Citations of this work
Functional interpretations of feasibly constructive arithmetic.Stephen Cook & Alasdair Urquhart - 1993 - Annals of Pure and Applied Logic 63 (2):103-200.
An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras.Martin Hofmann - 1997 - Bulletin of Symbolic Logic 3 (4):469-486.
On parallel hierarchies and Rki.Stephen Bloch - 1997 - Annals of Pure and Applied Logic 89 (2-3):231-273.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
References found in this work
Über eine bisher noch nicht benützte erweiterung Des finiten standpunktes.Von Kurt Gödel - 1958 - Dialectica 12 (3‐4):280-287.
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.
Ardeshir, M., Ruitenburg, W. and Salehi, S., Intuitionistic.C. Areces, P. Blackburn, M. Marx, S. Cook, A. Kolokolova, T. Coquand, G. Sambin, J. Smith, S. Valentini & P. Dybjer - 2003 - Annals of Pure and Applied Logic 124:301.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-sqlzn uwo