A general form of relative recursion
| dc.creator | van Oosten, Jaap | |
| dc.date | 2005-10-10 | |
| dc.date.accessioned | 2026-07-07T06:47:18Z | |
| dc.date.available | 2026-07-07T06:47:18Z | |
| dc.description | For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated in terms of Longley's 2-category of pcas and decidable applicative morphisms. | |
| dc.description | 10 pages, see also http://www.math.uu.nl/people/jvoosten/realizability/relrec.ps.gz | |
| dc.identifier | https://arxiv.org/abs/math/0510189 | |
| dc.identifier | http://arxiv.org/abs/math/0510189 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103606 | |
| dc.subject | Logic | |
| dc.subject | 03B40; 68N18 | |
| dc.title | A general form of relative recursion | |
| dc.type | text |