Logics of Programs with Boolean Memory
Affiliation:
1. Institute of Mathematics, University of Warsaw, 00-901 Warszawa, PKiN, Poland
Abstract
We discuss the computational power of programs with boolean (propositional) push-down stores and arrays, and the expressive power of logics based on these programs. In particular we show that over unary structures, the mentioned logics occur to be equivalent to their “algebraic counterparts.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献