Recall the syntax of hyper-propositional logic (see e.g. [1]): Starting with any given atom set A we obtained an infinite hierarchy of formula sets by applying the following syntactical constructions:
On the other hand, there are the well known modal formulas M(A): given a set A, they are constructed by recursively and arbitrarily applying the box, diamond, conjunction, disjunction, and negation. But different to F(A), there are no degrees, the constructions can be performed on any argument formulas. We can read hyper-formulas as modal formulas. In this respect, F(A) is a subset of M(A).
Of course, the semantics of the two systems are very different. Hyper-formulas are interpreted as bit tables, modal formulas on the other hand describe Kripke models. Our goal here is to investigate the possible relations and mutual translations of these two systems.
... is under construction ...
[1]
Hyper-propositional logic: Summarized overview of its syntax and semantics
[2]
Mixed hyper-digital logic