On some Kripke complete and Kripke incomplete intermediate predicate logics (Q1580656)

The Kripke completeness problem of intermediate predicate logics is investigated in relation to the constant domain axiom, the Kuroda axiom, and three kinds of propositional axioms, including the weak excluded middle, which are cofinal subframe formulas comparable on the intuitionistic base. As for some of these logics the problem has been already solved affirmatively (or not) by the author, Shekhtman, Ghilardi, and Shimura. In this paper, the author determines it for the remaining ones. Among the seven systems to be discussed it is proved that two of them are Kripke complete but the other ones are not. In particular, the incompleteness result gives rise to a negative answer to Shimura's question asking whether any extension of the constant domain intermediate predicate logic with Kuroda axiom by disjunction-free propositional formulas is Kripke complete. The incompleteness proof is carried out by an application of Kripke bundle.