Please use this identifier to cite or link to this item:
|Title:||Some independence results for control structures in complete numberings|
|Authors:||Jain, S. |
|Citation:||Jain, S.,Nessel, J. (2001). Some independence results for control structures in complete numberings. Journal of Symbolic Logic 66 (1) : 357-382. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Journal of Symbolic Logic|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.