- 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
Roman Murawski, Recursive Functions and Metamathematics [Book Review]
Studia Logica 70 (2):297-299 (2002)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
Roman Murawski, recursive functions and metamathematics: Problems of completeness and decidability.E. Mendelson - 2000 - Philosophia Mathematica 8 (3):345-346.
Roman Murawski, recursive functions and metamathematics.Rod Downey - 2002 - Studia Logica 70 (2):297-299.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions.Robert A. di Paola - 1981 - Journal of Symbolic Logic 46 (2):216-232.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II.Iraj Kalantari & Lawrence Welch - 1999 - Annals of Pure and Applied Logic 98 (1-3):87-110.
Analytics
Added to PP
2017-02-21
Downloads
14 (#968,362)
6 months
5 (#638,139)
2017-02-21
Downloads
14 (#968,362)
6 months
5 (#638,139)
Historical graph of downloads
Author's Profile
Citations of this work
Rethinking Logic: Logic in Relation to Mathematics, Evolution, and Method.Carlo Cellucci - 2013 - Dordrecht, Netherland: Springer.
Abductive Reasoning: Logical Investigations Into Discovery and Explanation.Atocha Aliseda - 2005 - Dordrecht and London: Springer.
Strict Finitism and the Logic of Mathematical Applications.Feng Ye - 2011 - Dordrecht, Netherland: Springer.
Troubles with (the concept of) truth in mathematics.Roman Murawski - 2006 - Logic and Logical Philosophy 15 (4):285-303.
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-7c76586df8-4c2ch uwo