{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:51:31Z","timestamp":1762444291390},"publisher-location":"Berlin, Heidelberg","reference-count":53,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601784"},{"type":"electronic","value":"9783540447207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60178-3_76","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:48:43Z","timestamp":1330278523000},"page":"1-21","source":"Crossref","is-referenced-by-count":1,"title":["Strict finitism and feasibility"],"prefix":"10.1007","author":[{"given":"Felice","family":"Cardone","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science 789","first-page":"1","volume-title":"Theoretical Aspects of Computer Software, 1994","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF (Extended Abstract). In Masami Hagiya and J.C. Mitchell, editors, Theoretical Aspects of Computer Software, 1994, Lecture Notes in Computer Science 789, pages 1\u201315. Springer-Verlag, Berlin-Heidelberg-New York, 1994."},{"key":"1_CR2","unstructured":"S.J. Bellantoni. Predicative recursion and computational complexity. Technical Report TR 264\/92, Department of Computer Science, University of Toronto, 1992."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"S.J. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 1993.","DOI":"10.1145\/129712.129740"},{"key":"1_CR4","first-page":"274","volume-title":"Philosophy of Mathematics","author":"P. Bernays","year":"1964","unstructured":"P. Bernays. On Platonism in Mathematics. In P. Benacerraf and H. Putnam, editors, Philosophy of Mathematics, pages 274\u2013288. Prentice-Hall, Englewood Cliffs, NJ, 1964. Originally appeared in French in L'Enseignement Math\u00e8matique, 1935, pp. 52\u201369."},{"key":"1_CR5","volume-title":"Les nombres inaccessibles","author":"\u00c9. Borel","year":"1952","unstructured":"\u00c9. Borel. Les nombres inaccessibles. Gauthier-Villars, Paris, 1952."},{"key":"1_CR6","volume-title":"Bounded Arithmetic","author":"S. Buss","year":"1986","unstructured":"S. Buss. Bounded Arithmetic. Bibliopolis, Napoli, 1986."},{"key":"1_CR7","unstructured":"P.-L. Curien. Concrete data structures, sequential algorithms, and linear logic. Message to the mailing list types@theory.lcs.mit.edu, June 3, 1992."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(82)91226-8","volume":"54","author":"M. Davis","year":"1982","unstructured":"M. Davis. Why G\u00f6del didn't have a Church's thesis. Information and Control, 54:3\u201324, 1982.","journal-title":"Information and Control"},{"key":"1_CR9","unstructured":"R. Dedekind. Essays on the Theory of Numbers. Dover, New York, 1963."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"M. Dummett. Wittgenstein's Philosophy of Mathematics. Philosophical Review, 68, 1959. Reprinted in Truth and Other Enigmas, Duckworth, London, 1978, pp. 166\u2013185.","DOI":"10.2307\/2182566"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF00485048","volume":"30","author":"M. Dummett","year":"1975","unstructured":"M. Dummett. Wang's paradox. Synthese, 30:301\u2013324, 1975. Reprinted in Truth and Other Enigmas, Duckworth, London, 1978, pp. 248\u2013268.","journal-title":"Synthese"},{"key":"1_CR12","volume-title":"Elements of Intuitionism","author":"M. Dummett","year":"1977","unstructured":"M. Dummett. Elements of Intuitionism. Clarendon Press, Oxford, 1977."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449\u2013467, 1965.","journal-title":"Canadian Journal of Mathematics"},{"key":"1_CR14","series-title":"Colloquia Mathematica Societas J\u00e1nos Bolyai, 26","volume-title":"Mathematical Logic in Computer Science","author":"E. Engeler","year":"1981","unstructured":"E. Engeler. An algorithmic model of strict finitism. In B. D\u00f6m\u00f6lki and T. Gergely, editors, Mathematical Logic in Computer Science, Colloquia Mathematica Societas J\u00e1nos Bolyai, 26, Amsterdam, 1981. North-Holland. This paper was written in 1971."},{"key":"1_CR15","volume-title":"Computability: Computable Functions, Logic and the Foundations of Mathematics","author":"R.L. Epstein","year":"1989","unstructured":"R.L. Epstein and W.A. Carnielli. Computability: Computable Functions, Logic and the Foundations of Mathematics. Wadsworth & Brooks\/Cole, Pacific Grove, Ca, 1989."},{"key":"1_CR16","first-page":"201","volume-title":"Infinitistic Methods","author":"A.S. Esenin-Vol'pin","year":"1961","unstructured":"A.S. Esenin-Vol'pin. Le programme ultra-intuitionniste des fondements des math\u00e8matiques. In Infinitistic Methods, pages 201\u2013223. Pergamon Press-PWN, Oxford and Warsaw, 1961."},{"key":"1_CR17","first-page":"3","volume-title":"Intuitionism and Proof Theory","author":"A.S. Esenin-Vol'pin","year":"1970","unstructured":"A.S. Esenin-Vol'pin. The ultra-intuitionistic criticism and the anti-traditional program for the foundations of mathematics. In A. Kino, J. Myhill, and R. Vesley, editors, Intuitionism and Proof Theory, pages 3\u201345. North-Holland, Amsterdam, 1970."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-94-009-5203-4_5","volume-title":"Handbook of Philosophical Logic, volume 3","author":"W. Felscher","year":"1986","unstructured":"W. Felscher. Dialogues as a foundation for intuitionistic logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 3, pages 341\u2013372. Reidel, Dordrecht, 1986."},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0049-237X(08)71257-6","volume-title":"The Kleene Symposium","author":"R.O. Gandy","year":"1980","unstructured":"R.O. Gandy. Church's Thesis and Principles for Mechanisms. In J. Barwise, H.J. Keisler, and K. Kunen, editors, The Kleene Symposium, pages 123\u2013148, Amsterdam, 1980. North-Holland."},{"issue":"1","key":"1_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2272346","volume":"39","author":"J.R. Geiser","year":"1974","unstructured":"J.R. Geiser. A formalization of Essenin-Volpin's proof theoretical studies by means of non-standard analysis. Journal of Symbolic Logic, 39(1):81\u201387, 1974.","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/00029890.1960.11989501","volume":"67","author":"L. Henkin","year":"1960","unstructured":"L. Henkin. On mathematical induction. American Mathematical Monthly, 67:323\u2013338, 1960.","journal-title":"American Mathematical Monthly"},{"key":"1_CR22","unstructured":"G. Huet and J.-J. L\u00e9vy. Call by need computations in non-ambiguous linear term rewriting systems. Rapport Laboria 359, IRIA, Aug. 1979."},{"key":"1_CR23","unstructured":"J.M.E. Hyland and C.-H.L. Ong. On full abstraction for PCF. Draft, October 1994."},{"key":"1_CR24","series-title":"Lecture Notes in Mathematics 873","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BFb0090731","volume-title":"Constructive Mathematics","author":"D. Isles","year":"1981","unstructured":"D. Isles. On the notion of standard non-isomorphic natural number series. In F. Richman, editor, Constructive Mathematics, Lecture Notes in Mathematics 873, pages 111\u2013134. Springer-Verlag, Berlin-Heidelberg-New York, 1981."},{"issue":"4","key":"1_CR25","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1305\/ndjfl\/1093634481","volume":"33","author":"D. Isles","year":"1992","unstructured":"D. Isles. What evidence is there that 265536 is a natural number? Notre Dame Journal of Formal Logic, 33(4):465\u2013480, 1992.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"1_CR26","unstructured":"D. Isles. A finite analog to the L\u00f6wenheim-Skolem theorem. To appear in Studia Logica, 199?."},{"key":"1_CR27","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"S.C. Kleene. Introduction to Metamathematics. Elsevier, New York, 1952."},{"key":"1_CR28","unstructured":"J.W. Klop. Term rewriting systems. Technical Report CS R9073, Centrum voor Wiskunde en Informatica, Amsterdam, 1990."},{"key":"1_CR29","volume-title":"The Art of Computer Programming, volume 1","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth. The Art of Computer Programming, volume 1. Addison Wesley, Reading, Ma, second edition, 1968.","edition":"second edition"},{"key":"1_CR30","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/bjps\/IX.34.135","volume":"9","author":"G. Kreisel","year":"1958","unstructured":"G. Kreisel. Wittgenstein's Remarks on the Foundations of Mathematics. British Journal for the Philosophy of Science, 9:135\u2013158, 1958.","journal-title":"British Journal for the Philosophy of Science"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"D. Leivant. A foundational delineation of poly-time. Information and Computation, 1993.","DOI":"10.1006\/inco.1994.1038"},{"key":"1_CR32","volume-title":"Stratified functional programs and computational complexity","author":"D. Leivant","year":"1993","unstructured":"D. Leivant. Stratified functional programs and computational complexity. In Conference Records of the Twentieth Annual ACM Symposium on Principles of Programming Languages, New-York, 1993. ACM."},{"key":"1_CR33","first-page":"193","volume-title":"Infinitistic Methods","author":"P. Lorenzen","year":"1961","unstructured":"P. Lorenzen. Ein dialogisches Konstructivit\u00e4tskriterium. In Infinitistic Methods, pages 193\u2013200. Pergamon Press-PWN, Oxford and Warsaw, 1961."},{"key":"1_CR34","unstructured":"G. Mannoury. Methodologisches und Philosophisches zur Elementar-Mathematik. Haarlem, 1909."},{"key":"1_CR35","unstructured":"G. Mannoury. Woord en Gedachte. Groningen, 1931."},{"key":"1_CR36","doi-asserted-by":"crossref","DOI":"10.1515\/9781400858927","volume-title":"Predicative Arithmetic","author":"E. Nelson","year":"1986","unstructured":"E. Nelson. Predicative Arithmetic. Princeton University Press, Princeton, 1986."},{"issue":"3","key":"1_CR37","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","volume":"36","author":"R. Parikh","year":"1971","unstructured":"R. Parikh. Existence and feasibility in arithmetic. Journal of Symbolic Logic, 36(3):494\u2013508, 1971.","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR38","unstructured":"C. Parsons. The impredicativity of induction. In M. Detlefsen, editor, Proof, Logic and Formalization, pages 139\u2013161. Routledge, London and New York, 1992."},{"issue":"4","key":"1_CR39","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1070\/RM1973v028n04ABEH001602","volume":"28","author":"P.K. Rashevskii","year":"1973","unstructured":"P.K. Rashevskii. On the dogma of natural numbers. Russian Mathematical Surveys, 28(4):143\u2013148, 1973.","journal-title":"Russian Mathematical Surveys"},{"key":"1_CR40","doi-asserted-by":"crossref","DOI":"10.1515\/9781503622135","volume-title":"Ad Infinitum. The Ghost in Turing's Machine","author":"B. Rotman","year":"1993","unstructured":"B. Rotman. Ad Infinitum. The Ghost in Turing's Machine, Stanford University Press, Stanford, CA, 1993."},{"issue":"1","key":"1_CR41","first-page":"331","volume":"57","author":"V. Sazonov","year":"1992","unstructured":"V.Yu. Sazonov. On feasible numbers. Journal of Symbolic Logic, 57(1):331, 1992. Abstract of an unpublished paper with the same title.","journal-title":"Journal of Symbolic Logic"},{"key":"1_CR42","first-page":"195","volume-title":"On feasible numbers (preliminary version)","author":"J. Simon","year":"1977","unstructured":"J. Simon. On feasible numbers (preliminary version). In Conference Record of the Ninth Annual Symposium on the Theory of Computing, pages 195\u2013207, New York, NY, 1977. Association for Computing Machinery."},{"key":"1_CR43","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-94-009-6309-2_10","volume-title":"Aspects of Vagueness","author":"A. Sochor","year":"1984","unstructured":"A. Sochor. The Alternative Set Theory and its approach to Cantor's Set Theory. In H.J. Skala, S. Termini, and E. Trillas, editors, Aspects of Vagueness, Theory and Decision Library, pages 161\u2013203, Dordrecht, 1984. Reidel."},{"issue":"2","key":"1_CR44","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1305\/ndjfl\/1093957800","volume":"5","author":"W. Stegm\u00fcller","year":"1964","unstructured":"W. Stegm\u00fcller. Remarks on the completeness of logical systems relative to the validity-concepts of P. Lorenzen and K. Lorenz. Notre Dame Journal of Formal Logic, 5(2):81\u2013112, 1964.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"1_CR45","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936\u201337","unstructured":"A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230\u2013265, 1936\u201337.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"1_CR46","volume-title":"Preprint 17","author":"J. Bendegem van","year":"1985","unstructured":"J. van Bendegem. Finite, empirical mathematics: outline of a model. Preprint 17, Rijksuniversiteit, Gent, Belgium, 1985."},{"key":"1_CR47","first-page":"273","volume":"19","author":"D. Dantzig van","year":"1956","unstructured":"D. van Dantzig. Is $$10^{(10^{10} )}$$ a finite number? Dialectica, 19:273\u2013277, 1956. Reprinted in Epstein & Carnielli 1989, pp. 258\u2013261.","journal-title":"Dialectica"},{"key":"1_CR48","volume-title":"Mathematics in the Alternative Set Theory","author":"P. Vop\u011bnka","year":"1979","unstructured":"P. Vop\u011bnka. Mathematics in the Alternative Set Theory. Teubner, Leipzig, 1979."},{"key":"1_CR49","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1111\/j.1746-8361.1958.tb01476.x","volume":"12","author":"H. Wang","year":"1958","unstructured":"H. Wang. Eighty years of foundational studies. Dialectica, 12:466\u2013497, 1958. All quotations are from the reprint of the paper in Hao Wang, Logic, Computers and Sets, Chelsea Publishing Company, New York, 1970, pp. 34\u201356.","journal-title":"Dialectica"},{"key":"1_CR50","volume-title":"Bemerkungen \u00fcber die Grundlagen der Mathematik","author":"L. Wittgenstein","year":"1956","unstructured":"L. Wittgenstein. Bemerkungen \u00fcber die Grundlagen der Mathematik. Blackwell, Oxford, 1956. Edited by G.H. von Wright, R. Rhees and G.E.M. Anscombe."},{"key":"1_CR51","volume-title":"Philosophische Grammatik","author":"L. Wittgenstein","year":"1969","unstructured":"L. Wittgenstein. Philosophische Grammatik. Blackwell, Oxford, 1969. Edited by R. Rhees."},{"key":"1_CR52","volume-title":"Wittgenstein on the Foundations of Mathematics","author":"C. Wright","year":"1980","unstructured":"C. Wright. Wittgenstein on the Foundations of Mathematics. Duckworth, London, 1980."},{"key":"1_CR53","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF00413828","volume":"51","author":"C. Wright","year":"1982","unstructured":"C. Wright. Strict finitism. Synthese, 51:203\u2013282, 1982.","journal-title":"Synthese"}],"container-title":["Lecture Notes in Computer Science","Logic and Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60178-3_76.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:56:20Z","timestamp":1687287380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60178-3_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601784","9783540447207"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/3-540-60178-3_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}