Cain, James The theory of computability developed in terms of satisfaction. (English) Zbl 0989.03043 Notre Dame J. Formal Logic 40, No. 4, 515-532 (1999). Summary: 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 \(\mathbf{0}\), individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification. MSC: 03D75 Abstract and axiomatic computability and recursion theory 03F40 Gödel numberings and issues of incompleteness 03A05 Philosophical and critical aspects of logic and foundations Keywords:theory of truth; computability; satisfaction × Cite Format Result Cite Review PDF Full Text: DOI