Logics of some Kripke frames connected with Medvedev notion of informational types (Q1820765)

The intermediate propositional logics we consider here describe the set I(\(\Omega)\) of regular informational types introduced by \textit{Yu. T. Medvedev} [Semiotika Inf. 13, 109-141 (1979; Zbl 0485.03002)]. He showed that I(\(\Omega)\) is a Heyting algebra. This algebra gives rise to the ''logic of infinite problems'' from the second author's paper [Dokl. Akad. Nauk SSSR 245, 798-801 (1979; Zbl 0438.03028)] denoted here as \(LM_ 1\). Some other definitions of negation in I(\(\Omega)\) lead to logics \(LM_ n\) (n\(\leq \omega)\). We study inclusions between these and other systems, prove \(LM_ n\) to be non-finitely axiomatizable (n\(\leq \omega)\) and recursively axiomatizable \((n<\omega)\). We also show that formulas in one variable do not separate \(LM_{\omega}\) from Heyting's logic H, and \(LM_ n\) \((n<\omega)\) from Scott's logic \((H+S)\).