The Theory of Computability Developed in Terms of Satisfaction

Notre Dame Journal of Formal Logic 40 (4):515-532 (1999)
  Copy   BIBTEX

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.

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.Egon Börger - 1989 - New York, N.Y., 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.André Nies - 2008 - Oxford, England: Oxford University Press.

Analytics

Added to PP
2010-08-24

Downloads
236 (#82,362)

6 months
58 (#73,015)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

James Cain
Oklahoma State University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references