Admissible rules for logics containing S4.3 (Q1068809): Difference between revisions

The aim of this article is the investigation of rules of inference in logics containing S4.3 modal propositional logic. We use an algebraic approach to admissibility: the rule A/B is admissible in logic \(\lambda\) iff the quasi-identity \(A=1\Rightarrow B=1\) is true on the free algebra \(F_{\omega}(\lambda)\) of denumerable rank from the variety of modal algebras corresponding to \(\lambda\). Theorem 5. The free algebra \(F_{\omega}(\lambda)\) has a finite basis of quasi-identities which is constructed by adding \(\diamond x\wedge \diamond \neg x=1\Rightarrow y=1\) to basis identities of \(F_{\omega}(\lambda)\) when \(\lambda\) \(\supseteq S4.3.\) From this theorem we obtain that there exists an algorithm for recognizing admissibility rules in a modal logic \(\lambda\) by its axiom set when \(\lambda\) \(\supseteq S4.3.\) Proposition 7. Let f/g be an admissible but not derivable rule in a logic \(\lambda\) \(\supseteq S4.3\). Then for every \(t_ i:\) \(f(t_ i)\not\in \lambda\). That is, each admissible, non derivable rule in \(\lambda\) \(\supseteq S4.3\) has no antecedent feasible in \(\lambda\). Proposition 8. For all \(\lambda\) \(\supseteq S4.3\), the logic \(\lambda\) with additional rule of inference \(\diamond x\wedge \diamond \neg x/y\) is structurally complete. In particular, when \(\lambda =S5\), these propositions give an affirmative solution to the questions of \textit{J. Porte} [J. Philos. Logic 10, 409-422 (1981; Zbl 0475.03005)].