On the expressive power of program schemes with sets

The author considers flow diagrams with sets, which is the class of program schemes equipped with finite sets of different levels, so that FDSet/sub 1/ is such a class equipped with finite sets, FDSet/sub 2/ is such a class equipped with finite sets and finite sets of finite sets, etc. He proves FDSet/sub 1/ is semi-universal. In particular, in infinite structures FDSet/sub 1/ is able to define every (generalized) computable function. For finite structures, the halting problem for FDSet/sub 1/, is decidable, and it is proved that DL(FDSet/sub 1/) exactly corresponds to the LINEARSPACE complexity class.<<ETX>>

[1]  Joseph Y. Halpern,et al.  On effective axiomatizations of Hoare logics , 1982, POPL '82.

[2]  Edmund M. Clarke,et al.  Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems , 1979, JACM.

[3]  Larry J. Stockmeyer,et al.  Classifying the computational complexity of problems , 1987, The Journal of Symbolic Logic.

[4]  Alexei P. Stolboushkin,et al.  Flow-diagrams with sets , 1988, Conference on Computer Logic.

[5]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[6]  A. P. Stolboushkin,et al.  Some open questions in the theory of program schemes and dynamic logics , 1989 .

[7]  Jerzy Tiuryn,et al.  Some Relationships Between Logics of Programs and Complexity Theory , 1988, Theor. Comput. Sci..

[8]  Stephen A. Cook,et al.  Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[9]  David Peleg,et al.  On Static Logics, Dynamic Logics, and Complexity Classes , 1984, Inf. Control..

[10]  J. Tiuryn,et al.  Some relationships between logics of programs and complexity theory , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  A. P. Stolboushkin,et al.  Positive program logics in systems with arithmetic , 1984 .

[12]  Harvey M. Friedman,et al.  Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[13]  Alexei P. Stolboushkin,et al.  Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic , 1984, Inf. Control..