๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Effective operations on partial recursive functions

โœ Scribed by J. Myhill; J. C. Shepherdson

Publisher
John Wiley and Sons
Year
1955
Tongue
English
Weight
431 KB
Volume
1
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Topological Size of Sets of Partial Recu
Topological Size of Sets of Partial Recursive Functions
โœ Cristian Calude ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 478 KB ๐Ÿ‘ 1 views

TOPOLOGICAL SIZE OF SETS O F PARTIAL RECURSIVE FUNCTIONS by CRISTIAN CALUDE in Bucharest (Romania) l) 1) I wish to thank Prof. G. WECHSUNG for helpful comments on this work.

Note on the 3-Recursive Functions
Note on the 3-Recursive Functions
โœ Paul Axt ๐Ÿ“‚ Article ๐Ÿ“… 1961 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 73 KB ๐Ÿ‘ 1 views
The Computation of Partial Recursive Wor
The Computation of Partial Recursive Word-Functions Without Read Instructions
โœ Holger Petersen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 422 KB ๐Ÿ‘ 1 views

## Abstract In this note we consider registerโ€machines with symbol manipulation capabilities. They can form words over a given alphabet in their registers by appending symbols to the strings already stored. These machines are similar to Post's normal systems and the related machineโ€models discussed

On the proof theory of type two function
On the proof theory of type two functionals based on primitive recursive operations
โœ David Steiner; Thomas Strahm ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 209 KB

## Abstract This paper is a companion to work of Feferman, Jรคger, GlaรŸ, and Strahm on the proof theory of the type two functionals __ฮผ__ and E~1~ in the context of Fefermanโ€style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlรผter's we