Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society
ISSN 1088-6850(online) ISSN 0002-9947(print)


Syntax and semantics in higher-type recursion theory

Author: David P. Kierstead
Journal: Trans. Amer. Math. Soc. 276 (1983), 67-105
MSC: Primary 03D65
MathSciNet review: 684494
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Recursion in higher types was introduced by S. C. Kleene in 1959. Since that time, it has come to be recognized as a natural and important generalization of ordinary recursion theory. Unfortunately, the theory contains certain apparent anomalies, which stem from the fact that higher type computations deal with the intensions of their arguments, rather than the extensions. This causes the failure of the substitution principle (that if $ \varphi ({\alpha ^{j + 1}},\mathfrak{A})$ and $ \theta ({\beta ^j},\mathfrak{A})$ are recursive, then there should be a recursive $ \psi (\mathfrak{A})$ such that $ \psi (\mathfrak{A}) \simeq \varphi (\lambda {\beta ^j}\theta ({\beta ^j},\mathfrak{A}),\mathfrak{A})$ at least whenever $ \lambda {\beta ^j}\theta ({\beta ^j},\mathfrak{A})$ is total), and of the first recursion principle (that if $ {\mathbf{F}}(\zeta ;\mathfrak{A})$ is a recursive functional, then the minimal solution $ \zeta $ of the equation $ {\mathbf{F}}(\zeta ;\mathfrak{A}) \simeq \zeta (\mathfrak{A})$ should be recursive as well). In an effort to remove--or at least explain--these anomalies, Kleene, in 1978, developed a system for computation in higher types which was based entirely on the syntactic manipulation of formal expressions, called $ j$-expressions. As Kleene pointed out, no adequate semantics for these expressions can be based on the classical (total) type structure $ Tp$ over $ {\mathbf{N}}$. In a paper to appear in The Kleene Symposium (North-Holland), we showed that an appropriate semantics could be based on the type structure $ \hat Tp$, which is obtained by adding a new object $ \mathfrak{u}$ at level 0 and, at level $ (j + 1)$, allowing all monotone, partial functions from type $ \hat j$ into $ {\mathbf{N}}$. Over $ \hat Tp$, both of the principles mentioned above do hold. There is a natural embedding to $ Tp$ into $ \hat Tp$.

In this paper, we complement the syntactic structure with a syntax-free definition of recursion over $ \hat Tp$, and show that the two notions are equivalent. This system admits an enumeration theorem, in spite of the fact that the presence of partial objects complicates the coding of finite sequences. Indeed, it is not possible to code all finite sequences from type $ \hat j$ as type-$ \hat j$ objects. We use the combination of the syntactic and semantic systems to prove that, for any $ \varphi: Tp^{(\sigma)}\mathop \to \limits_p {\mathbf{N}} $, the following are equivalent:

A. $ \varphi $ is recursive in the sense of Kleene [1959],

B. $ \varphi $ is recursive in the sense of Kleene [1978], and

C. $ \varphi $ is the pull-back in $ Tp$ of some recursive $ \psi :\hat T{p^{(\sigma )}}\mathop \to \limits_p {\mathbf{N}}$.

Using these equivalences, we give a necessary and sufficient condition on $ \theta :T{p^{(\sigma )}}\mathop \to \limits_p {\mathbf{N}}$, under which the substitution principle mentioned above will hold for any recursive $ \varphi :T{p^{(\tau )}}\mathop \to \limits_p {\mathbf{N}}$. With one trivial exception, the condition is that if $ j \geqslant 1$, then $ \mathfrak{A}$ must contain a variable of type greater than $ j$. We feel that this result is particularly natural in the current setting.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 03D65

Retrieve articles in all journals with MSC: 03D65

Additional Information

PII: S 0002-9947(1983)0684494-7
Article copyright: © Copyright 1983 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia