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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

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

Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Some independence results for control structures in complete numberings.Sanjay Jain & Jochen Nessel - 2001 - Journal of Symbolic Logic 66 (1):357-382.
Effective operations on partial recursive functions.J. Myhill & J. C. Shepherdson - 1955 - Mathematical Logic Quarterly 1 (4):310-317.
Topological Size of Sets of Partial Recursive Functions.Cristian Calude - 1982 - Mathematical Logic Quarterly 28 (27‐32):455-462.
Hartley RogersJr., Gödel numberings of partial recursive functions. The journal of symbolic logic, vol. 23 no. 3 , pp. 331–341.Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146.
Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property.Akira Kanda - 1995 - Mathematical Logic Quarterly 41 (1):39-48.
A Note on Conjectures of Calude About the Topological Size of Sets of Partial Recursive Functions.Gisela Schäfer - 1985 - Mathematical Logic Quarterly 31 (14-18):279-280.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
Stability of representations of effective partial algebras.Jens Blanck, Viggo Stoltenberg-Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.

Analytics

Added to PP
2013-12-01

Downloads
53 (#408,867)

6 months
10 (#404,653)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.

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.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.

View all 6 references / Add more references