Abstract
By language we understand a lower predicate calculus with identity and (perhaps) relation and function symbols. It is convenient to allow for more than one sort of variable. Now each individual constant (if there are any) is of a specified sort, the formal expressions R(t1, … tn), f(t1,…, tn) are well formed only if the terms t1, …, tn are of specified sorts determined by the relation symbol R and the function symbol f, and the term f(t1, …, tn) (if well formed) is of a sort determined by f. We admit s = t as well formed, no matter what the sorts of s and t.
Publisher
Cambridge University Press (CUP)
Reference28 articles.
1. Representability of sets in formal systems
2. Moschovakis Y. N. , Post's theorem in the analytic hierarchy (in preparation).
3. Moschovakis Y. N. , Generalizations of the theory of recursive and hyperarithmetic relations to abstract domains (in preparation).
4. Abstract first order computability. II
5. Abstract first order computability. I;Moschovakis;Transactions of the American Mathematical Society,1969
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献