Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T00:13:53.531Z Has data issue: false hasContentIssue false

Some independence results for control structures in complete numberings

Published online by Cambridge University Press:  12 March 2014

Sanjay Jain
Affiliation:
National University of Singapore, School of Computing, Singapore. 119260, Singapore, E-mail: sanjay@comp.nus.edu.sg
Jochen Nessel
Affiliation:
Universität Kaiserslautern, FB Informatik, Postfach 3049. 67653. Kaiserslautern, Germany, E-mail: nessel@informatik.uni-kl.de

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable