Abstract

It is proved that no logic of programs with unbounded memory is reducible to a bounded memory programming logic. This is achieved by carefully analyzing firstorder definability in the algebra of finite binary trees.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call