Some independence results for control structures in complete numberings

&
Journal of Symbolic Logic 66 (1):357-382 (2001)
  Copy   BIBTEX

Abstract

Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem. Those properties are sometimes called control structures, to emphasize that they yield tools to implement programs in programming systems. It has been studied, among others by Riccardi and Royer, how these control structures influence or even characterize the notion of acceptable programming system. The following is an investigation, how these control structures behave in the more general setting of complete numberings as defined by Mal'cev and Eršov.

Categories

Keywords

Reprint years

DOI

10.2307/2694927

Links

PhilArchive



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

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.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20-21):285-296.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
On recursively enumerable structures.Victor Selivanov - 1996 - Annals of Pure and Applied Logic 78 (1-3):243-258.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
A Note on Weakly O-Minimal Structures and Definable Completeness.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48 (2):281-292.
Corporate social responsiveness: Choosing between hierarchical and contractual control. [REVIEW]Steven R. Salbu - 1993 - Journal of Business Ethics 12 (1):27 - 35.
Some Remarks on Generic Structures.David M. Evans & Mark Wing Ho Wong - 2009 - Journal of Symbolic Logic 74 (4):1143-1154.
Direct control.Alfred R. Mele - 2017 - Philosophical Studies 174 (2):275-290.
Natural language programming of agents and robotic devices.Sandor M. Veres - unknown
Generalizations of small profinite structures.Krzysztof Krupiński - 2010 - Journal of Symbolic Logic 75 (4):1147-1175.
Content, Control and Display: The Natural Origins of Content.Kim Sterelny - 2015 - Philosophia 43 (3):549-564.
The notion of independence in categories of algebraic structures, part I: Basic properties.Gabriel Srour - 1988 - Annals of Pure and Applied Logic 38 (2):185-213.

Analytics

Added to PP
2017-02-21

Downloads
10 (#1,160,791)

6 months
5 (#652,053)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On computable numberings of families of Turing degrees.Marat Faizrahmanov - forthcoming - Archive for Mathematical Logic:1-14.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Theorie der Numerierungen I.Ju L. Eršov - 1973 - Mathematical Logic Quarterly 19 (19‐25):289-388.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
Inductive Inference and Computable One-One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):463-479.

Add more references