Some independence results for control structures in complete numberings
Keyword(s):
AbstractAcceptable 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.
1981 ◽
Vol 22
(2)
◽
pp. 107-143
◽
2011 ◽
Vol 12
(1-2)
◽
pp. 5-34
◽
2010 ◽
Vol 9
(12)
◽
pp. 1699-1707
◽
2017 ◽
Vol 9
(4)
◽
pp. 343-352
Keyword(s):
1997 ◽
Vol 24
(1)
◽
pp. 1-23
◽