Publisher： Cambridge University Press
E-ISSN： 1943-5886|45|3|493-504
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.45, Iss.3, 1980-09, pp. : 493-504
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Sanchis [Sa] and Diller [Di] have introduced an interesting relation between terms for primitive recursive functionals of finite type in order to obtain a computability proof. The method is as follows. First the relation is shown to be well-founded. Then computability of each term is obtained by transfinite induction over the relation.
Related content
Aggregation on Finite Ordinal Scales by Scale Independent Functions
By Marichal Jean-Luc Mesiar Radko
Order, Vol. 21, Iss. 2, 2004-05 ,pp. :
Access to resources
Recommend
A Model-Theoretic Approach to Ordinal Analysis
Bulletin of Symbolic Logic, Vol. 3, Iss. 1, 1997-03 ,pp. :
Ordinal analysis of simple cases of bar recursion
The Journal of Symbolic Logic, Vol. 46, Iss. 1, 1981-03 ,pp. :
The model-theoretic ordinal analysis of theories of predicative strength
The Journal of Symbolic Logic, Vol. 64, Iss. 1, 1999-03 ,pp. :
Recent Advances in Ordinal Analysis:
Bulletin of Symbolic Logic, Vol. 1, Iss. 4, 1995-12 ,pp. :