In previous texts (e.g. ), we defined bit table sets and their bit table algebras . Each one was fixed in the sense that carrier A and degree k were constants in the given context. We now ask for possibilities to define mixed algebras, in particular on
Similar to these versions of bit table algebras, we try to generalize the different "fixed" hyper-propositional formula algebras by defining a mixed hyper-propositional formula algebra F(A).
... is under construction ...
 Hyper-propositional logic: Summarized overview of its syntax and semantics