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 to0, individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.
Citation
James Cain. "The Theory of Computability Developed in Terms of Satisfaction." Notre Dame J. Formal Logic 40 (4) 515 - 532, Fall 1999. https://doi.org/10.1305/ndjfl/1012429716
Information