Abstract
In this paper we argue that Revision Rules, introduced by Anil Gupta and Nuel Belnap as a tool for the analysis of the concept of truth, also provide a useful tool for defining computable functions. This also makes good on Gupta's and Belnap's claim that Revision Rules provide a general theory of definition, a claim for which they supply only the example of truth. In particular we show how Revision Rules arise naturally from relaxing and generalizing a classical construction due to Kleene, and indicate how they can be employed to reconstruct the class of the general recursive functions. We also point at how Revision Rules can be employed to access non-minimal fixed points of partially defined computing procedures.
Similar content being viewed by others
References
Antonelli, G. A.: 1992, Revision Rules: an Investigation into Non-Monotonic Inductive Definitions, doctoral Dissertation, University of Pittsburgh, Pittsburgh, PA.
Antonelli, G. A.: 1994a, ‘Non-Well-Founded Sets via Revision’, Journal of Philosophical Logic 23, 633–79.
Antonelli, G. A.: 1994b, ‘A Revision-Theoretic Analysis of the Arithmetical Hierarchy’, Notre Dame Journal of Formal Logic 35, 204–18.
Belnap, N. D.: 1982, ‘Gupta's Rule of Revision Theory of Truth’, Journal of Philosophical Logic 11, 103–16.
Gödel, K.: 1931, ‘Über formal Unentscheidbare Sätze der Principia Mathematica und Verwandte Systeme’, Monatshefte für Mathematik und Physik 38, 173–98.
Gödel, K.: 1940, The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory, Princeton University Press, Princeton, NJ, (Vol. 3 of the Annals of Mathematical Studies).
Gupta, A.: 1982, ‘Truth and Paradox’, Journal of Philosophical Logic 11, 1–60.
Gupta, A.: 1989, ‘Remarks on Definitions and the Concept of Truth’, Proceedings of the Aristotelian Society 89, 227–46.
Gupta, A. and Belnap, N. D.: 1993, The Revision Theory of Truth, MIT Press, Cambridge, MA.
Hinman, P.: 1989, Recursion-Theoretic Hierarchies, Springer, New York and Heidelberg.
Kleene, S. C.: 1952, Introduction to Metamathematics, Van Nostrand, Princeton, NJ.
Manna, Z. and Shamir, A.: 1977, The Convergence of Functions to Fixed points of Recursive Definitions, Tech. Report of the Stanford Computer Science Dept., Stanford, CA.
Rogers, H.: 1967, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, NY.
Author information
Authors and Affiliations
Additional information
I thank Nuel Belnap, Rich Thomason, Ken Manders, and Jamie Tappenden for much helpful advice given while I was trying to get clear on the ideas presented here. I also thank two anonymous referees for helpful comments and criticisms on an earlier version of this paper.
Rights and permissions
About this article
Cite this article
Antonelli, G.A. What's in a function?. Synthese 107, 167–204 (1996). https://doi.org/10.1007/BF00413605
Issue Date:
DOI: https://doi.org/10.1007/BF00413605