加载中…
Let be the superintuitionistic logic defined by the axiom , or equivalently, by Andrew’s axiom. It is easy to check that is contained in Medvedev’s logic and contains both Kreisel-Putnam logic and Scott logic. We show that on frames, corresponds to a certain first-order property, called the ``strong union’’ property. The strong completeness of , with respect to the class of frames enjoying this property, is proved. Furthermore, we demonstrate that has the disjunction property. As a result, stands as the strongest logic currently known below Medvedev’s logic that has both an axiomatization and the disjunction property.

生成讲解博客的中文版本

生成AI智能校验的中文版本