A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
"During" cannot be expressed by "after"
1986
Journal of computer and system sciences (Print)
We prove that the operator i ("during") is not expressible in first-order logics of programs based on the operator ( ) ("after"), but it is expressible with the help of array assignments or rich tests. From this we deduce that array assignments add to the power of logics based on nondeterministic effective tree-schemes and that rich tests add to the power of logics based on flowcharts. The proof of the main theorem is based on a result of Furst, Saxe, and Sipser (in "Proc. 22nd Found. of
doi:10.1016/0022-0000(86)90005-x
fatcat:ckuvyxjodbar7au5ail4obh37a