Abstract Computability and Invariant Definability
- 1 February 1970
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 34 (4) , 605-633
- https://doi.org/10.2307/2270854
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.Keywords
This publication has 16 references indexed in Scilit:
- Abstract First Order Computability. ITransactions of the American Mathematical Society, 1969
- Abstract first order computability. IITransactions of the American Mathematical Society, 1969
- Autonomous Transfinite Progressions and the Extent of Predicative MathematicsStudies in Logic and the Foundations of Mathematics, 1968
- Systems of predicative analysisThe Journal of Symbolic Logic, 1964
- Representability of sets in formal systemsProceedings of Symposia in Pure Mathematics, 1962
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)American Journal of Mathematics, 1955
- Recursive well-orderingsThe Journal of Symbolic Logic, 1955
- Arithmetical predicates and function quantifiersTransactions of the American Mathematical Society, 1955
- Hierarchies of number-theoretic predicatesBulletin of the American Mathematical Society, 1955
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931