What's in a function?

Synthese 107 (2):167 - 204 (1996)
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.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,018
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

4 ( #254,829 of 1,101,120 )

Recent downloads (6 months)

1 ( #290,780 of 1,101,120 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.