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.

Author's Profile

James Cain
Oklahoma State University

Analytics

Added to PP
2010-08-24

Downloads
234 (#61,794)

6 months
57 (#68,857)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?