The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions

Mathematical Logic Quarterly 28 (20‐21):285-296 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19820282002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Some independence results for control structures in complete numberings.Sanjay Jain & Jochen Nessel - 2001 - Journal of Symbolic Logic 66 (1):357-382.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Review: Hartley Rogers, Godel Numberings of Partial Recursive Functions. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146-146.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Review: Louise Hay, On Creative Sets and Indices of Partial Recursive Functions; Louise Hay, Isomorphism Types of Index Sets of Partial Recursive Functions; Louise Hay, Index Sets of Finite Classes of Recursively Enumerable Sets. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Partial Combinatory Algebras of Functions.Jaap van Oosten - 2011 - Notre Dame Journal of Formal Logic 52 (4):431-448.
Stability of representations of effective partial algebras.Jens Blanck, Viggo Stoltenberg-Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
Partial recursive functions and ω-functions.C. H. Applebaum & J. C. E. Dekker - 1970 - Journal of Symbolic Logic 35 (4):559-568.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.

Analytics

Added to PP
2013-12-01

Downloads
14 (#983,512)

6 months
5 (#627,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.

View all 6 references / Add more references