?
A Note on Strictly Positive Logics and Word Rewriting Systems
P. 61–70.
Beklemishev L. D.
We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable finitely axiomatizable strictly positive normal modal logics. The translation has its counterpart on the level of proofs: we formulate a natural deep inference proof system for strictly positive logics generalizing derivations in word rewriting systems. We also make some observations and formulate open questions related to the theory of modal companions of superintuitionistic logics that was initiated by L.L. Maksimova and V.V. Rybakov.
