1965/01/01 by R. A. Bull · 2 citations
Computer Science · #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.1305/ndjfl/1093958154
This system, which he calls MIPQ, is analogous to S5, in the sense that adding ANpp to it yields S5, and is intuitionistically plausible, in the sense that collapsing the modal operators yields IC. The purpose of this paper is to give a characterization of the normal models for MIPQ (in section 2) and show that it has the finite model property (in section 3). From this last result it follows immediately that MIPQ is decidable, since its normal models are strong models for the rules.