### Abstract

They first noticed that Gold’s limiting recursive functions which was originally introduced to formulate the learning processes of machines, serve as approximation algorithms. Here, Gold’s limiting recursive function is of the form $f(x) $ such that $f(x)=y \Leftrightarrow\exists t_{0}\forall t>t_{0}.g(t,x)=y\Leftrightarrow\lim_{t}g(t, x)=y$, $t $ where $g(t, x) $ is called a guessing function, and is a limit variable. Then, they proved that some limiting recursive functions approximate arealizer of a semi-classical principle $\neg\neg\exists y\forall x.g(x, y)=0arrow\exists y\forall x.g(x, y)=0$. Also, they showed impressive usages of the semi-classical principle for mathematics and for software synthesis. In this way, Nakata-Hayashi opened up the possibility that limiting operations provide readability interpretation of semi-classical logical systems. They formulated the set of the limiting recursive functions as a Basic Recursive hnction Theory(brft, for short. Wagner[19] and Strong[16]). Then Nakata-Hayashi carried out their readability interpretation using the BRFT.

### Citations

1135 | The Lambda-Calculus, its syntax and semantics - Barendregt - 1984 |

488 |
Recursively Enumerable Sets and Degrees
- Soare
- 1987
(Show Context)
Citation Context ...ursive functions introduced by Gold[7]. We assume the knowledge about the arithmetical hierarchy of sets and complete sets with respect to many-0ne reducibility. The standard reference is Soare’s book=-=[14]-=-. Proposition 2.2 (Gold[7]) 1. Atotal function guessed by apartial recursive function can be guessed by aprimitive recursive function. 2. A(partial) function guessed by atotal recursive function is ex... |

328 |
Lambda-mu-calculus: An Algorithmic Interpretation of Classical natural Deduction
- Parigot
- 1992
(Show Context)
Citation Context ...A-calculi of Kennaway-Klop-Sleep-de Vries[9] and Berarducci-Dezani[3]: Both have terms representing infinite B\"ohm-, L\’evyLongO-, or Berarducci-trees. 4. The typedfree $\lambda\mu$-calculus(Parigot =-=[12]-=-): The typed version corresponds version relates to a typed/typeto the classical logic, and a $\mathrm{t}\mathrm{y}\mathrm{p}\mathrm{e}\mathrm{d}/\mathrm{t}\mathrm{y}\mathrm{p}\mathrm{e}$-free $\mathr... |

85 |
Control operators, the SECD-machine, and the -calculus
- Felleisen, Friedman
- 1986
(Show Context)
Citation Context ...-calculus. $\mathrm{C}$ $(\mathrm{c}\mathrm{a}\mathrm{l}\mathrm{l}/\mathrm{c}\mathrm{c},$ to type-free/typed programming languages with control operators introduced by M. Felleisen and D. Friedman in =-=[4]-=-, raise-handle, $\ldots$ ). Since Nakata-Hayashi interpret aweak classical logic by alimiting realizabil$\lambda\mu$ ity interpretation, it is natural to ask whether we can interpret a calculi by aA-m... |

62 |
Realizability toposes and language semantics
- Longley
- 1994
(Show Context)
Citation Context ...$=\lambda x.$ xk, cdr $=\lambda x.x(\mathrm{k}\mathrm{i})$ . (8) 12sRemark 5.5 All the mor phisms which appear so far are happensto be discrete, projective, decidable applicative morphisms of Longley =-=[10]-=-. According to jlO, Chapter 3], they all induce functors between realizability toposes and they all preserve discrete objects; projectives; and finite colimits, NNO. 6An Interpretation of Type-free $\... |

52 | Classical Logic, Continuation semantics and abstract machines - Streicher, Reus - 1998 |

26 |
Vries. Infinitary lambda calculus
- Kennaway, Klop, et al.
- 1997
(Show Context)
Citation Context ...tenberg and Wainer [13] : An infinite sequence of proof-theoretic context, he introduced $T\circ$ theoretic context. studied $T_{0}$ 3. two infinite type- ree A-calculi of Kennaway-Klop-Sleep-de Vries=-=[9]-=- and Berarducci-Dezani[3]: Both have terms representing infinite B\"ohm-, L\’evyLongO-, or Berarducci-trees. 4. The typedfree $\lambda\mu$-calculus(Parigot [12]): The typed version corresponds version... |

24 |
Infinitely long terms of transfinite type
- Tait
- 1965
(Show Context)
Citation Context ...m{u}\mathrm{t}/\mathrm{o}\mathrm{u}\mathrm{t}\mathrm{p}\mathrm{u}\mathrm{t})$ and non-terminating recursive calls of functional programming languages. 1. Tait’s typed calculus of infinitely long terms=-=[17]-=-: An infinite sequence of type Aterms is again atyPe Aterm. His motivation was proof-theoretic. He wanted to define alarge class of calculable functionals of finite types. infinitely long terms (For d... |

14 |
Algebraically generalized recursive function theory
- Strong
- 1968
(Show Context)
Citation Context ...ide readability interpretation of semi-classical logical systems. They formulated the set of the limiting recursive functions as a Basic Recursive hnction Theory(brft, for short. Wagner[19] and Strong=-=[16]-=-). Then Nakata-Hayashi carried out their readability interpretation using the BRFT. If we can formulate the set of limiting algorithms as a $\mathrm{P}\mathrm{C}\mathrm{A}\mathcal{L}$ carrying out Nak... |

5 | A limiting first order realizability interpretation - Nakata, Hayashi |

4 |
Infinite lambda-calculus and types
- Berarducci, Dezani-Ciancaglini
- 1999
(Show Context)
Citation Context ... An infinite sequence of proof-theoretic context, he introduced $T\circ$ theoretic context. studied $T_{0}$ 3. two infinite type- ree A-calculi of Kennaway-Klop-Sleep-de Vries[9] and Berarducci-Dezani=-=[3]-=-: Both have terms representing infinite B\"ohm-, L\’evyLongO-, or Berarducci-trees. 4. The typedfree $\lambda\mu$-calculus(Parigot [12]): The typed version corresponds version relates to a typed/typet... |

2 |
Limiting recursion. Journal of symbolic Logic
- Gold
- 1965
(Show Context)
Citation Context ...s the set of partial numeric functions guessed by apartial numeric function in $F$ . In calibrating the computational power of $\lim(F)$ , we recall the limiting recursive functions introduced by Gold=-=[7]-=-. We assume the knowledge about the arithmetical hierarchy of sets and complete sets with respect to many-0ne reducibility. The standard reference is Soare’s book[14]. Proposition 2.2 (Gold[7]) 1. Ato... |

1 |
Classical logic as limit completion I&II
- Berardi
- 2001
(Show Context)
Citation Context ...rder to do so, we are concerned only with properties of limit operations which are relevant to PCAs. Different use limit in interpreting classical logic are introduced by Berardi. $\Delta_{2}^{0}$ In =-=[2]-=-, Berardi defined aconstructive model for maps. His model refines constructive interpretations for classical reasoning over one-quantifier formulas. In his model, he used acompletion idea, quite simil... |

1 |
On proof terms and embeddings of classical substructural logics
- Fujita
(Show Context)
Citation Context ...dot\cdot)$ . The $\eta$-like $\mu\alpha$ reduction on continuation . $[\alpha]Parrow$ turns out to be just infinite $\eta$-reductions(see Theorem 6.14). This idea of Parigot is being studied by Fujita=-=[5]-=-; with typ translation above precisely corresponds to G\"odel translation and $\alpha_{0},\alpha_{1}$ , $\ldots$ is finite. $\mu-\mathrm{v}\mathrm{a}\mathrm{r}\mathrm{i}\mathrm{a}\mathrm{b}\mathrm{l}\... |

1 |
Simple models of pur $\lambda\mu$-calculus
- Fujita
- 2001
(Show Context)
Citation Context ...alpha^{3}]Q)\cdots))Narrow_{\mu}\mu\alpha^{1}.(\cdots([\alpha^{2}](P’N))\cdots([\alpha^{3}]Q’)\cdots)$ , we have $t_{1}\geq t_{2}$ , $t_{3}$ , $\ldots$ . 7Related Work Model of Lambda-Mu Calculus. In =-=[6]-=-, Fujita constructed amodel of typefree $\mathrm{A}/\mathrm{x}$-calculus, which is induced, in atyped case, from G\"odel-Gentzen translation. The term model is obtained by the use of afixed point of a... |

1 |
Infinite terms and recursion in higher types
- Schwichtenberg, Wainer
- 1974
(Show Context)
Citation Context ...}$ the code of . After Feferman developed Tait’s typed A-calculus in a and in arecursive $T_{0}$ 2. S. Feferman’s typed calculus of $)$ $\langle P_{1}, P_{2}, \ldots\rangle$ Schwichtenberg and Wainer =-=[13]-=- : An infinite sequence of proof-theoretic context, he introduced $T\circ$ theoretic context. studied $T_{0}$ 3. two infinite type- ree A-calculi of Kennaway-Klop-Sleep-de Vries[9] and Berarducci-Deza... |

1 |
Uniformly reflexive structures: On the nature of G\"odelizations and relative computability
- Wagner
- 1969
(Show Context)
Citation Context ...operations provide readability interpretation of semi-classical logical systems. They formulated the set of the limiting recursive functions as a Basic Recursive hnction Theory(brft, for short. Wagner=-=[19]-=- and Strong[16]). Then Nakata-Hayashi carried out their readability interpretation using the BRFT. If we can formulate the set of limiting algorithms as a $\mathrm{P}\mathrm{C}\mathrm{A}\mathcal{L}$ c... |

1 |
Computability properties of Gaufiian function. available via http://www.ky0t0$\mathrm{s}\mathrm{u}.\mathrm{a}\mathrm{c}.\mathrm{j}\mathrm{p}/\sim \mathrm{y}\mathrm{a}\mathrm{s}\mathrm{u}\mathrm{g}\mathrm{i}/\mathrm{R}\mathrm{e}\mathrm{c}\mathrm{e}\mathrm{
- Yasugi, Brattka, et al.
- 1998
(Show Context)
Citation Context ...ause the output needs infinite precision on the input real number to determine whether the input is an integer or not. As Gauss function is rewritten as the limit according to Yasugi-Brattka Washihara=-=[20]-=-, it is in the extensional collapse of n-lim(4). nor . So, n-lim(J) is isomorphic to neither $D_{\infty}$ 5Repeating Limits $\mathrm{P}\mathrm{C}\mathrm{O}$ In functional programming, we use infinite ... |