An admissible semantics for propositionally quantified relevant logics (Q848213): Difference between revisions

Anderson and Belnap extended the relevant logics E and R by allowing quantification over propositional variables. The present paper provides a sound and complete relational semantics for axiomatizations of these systems (due to Meyer) and to many other relevant logics with quantification over propositional variables. This semantics has a restriction on which sets of worlds are admissible as propositions and an interpretation that makes \(\forall p A\) true when there is some true admissible proposition that entails all \(p\)-instantiations of \(A\). Without the admissibility qualification, the authors show that many of the systems considered are semantically incomplete. The incompleteness result involves an algebraic semantics based on atomless complete Boolean algebras.