The Theory of Computability Developed in Terms of Satisfaction

Notre Dame Journal of Formal Logic 40 (4):515-532 (1999)
Abstract
The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1012429716
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
Our Archive
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Remarks on the Development of Computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Spinoza's Theories of Value.Andrew Youpa - 2010 - British Journal for the History of Philosophy 18 (2):209 – 229.
Computability, Complexity, Logic.E. Börger - 1989 - New York: U.S.A.Elsevier Science Pub. Co..
Objective Content.Sven Rosenkranz - 2011 - Erkenntnis 74 (2):177-206.
Subjective Well-Being and Desire Satisfaction.Donald W. Bruckner - 2010 - Philosophical Papers 39 (1):1-28.
Computability and Randomness.Andreé Nies - 2008 - Oxford University Press.

Monthly downloads

Added to index

2010-08-24

Total downloads

38 ( #134,078 of 2,158,673 )

Recent downloads (6 months)

1 ( #354,589 of 2,158,673 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums