An alternative semantics for quantified relevant logic

Edwin Mares, Robert Goldblatt

Journal of Symbolic Logic · 2006 · 49 citations · 9 references

Concepts

TL;DR

RQ is given a new semantics in which ∀xA is true when a true proposition implies all x‑instantiations of A. Formulae are modeled as functions from variable assignments to propositions (sets of worlds), and a completeness proof for QR is provided, showing that adding the EC axiom requires an additional model condition involving the Boolean difference of propositions. The authors construct a QR‑model that falsifies EC by taking the disjoint union of two natural arithmetical structures with negation interpreted as subtraction.

Abstract

Abstract The quantified relevant logic RQ is given a new semantics in which a formula ∀ xA is true when there is some true proposition that implies all x -instantiations of A . Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀ x ( A ⋁ B ) → ( A ⋁ ∀ xB ), with x not free in A . Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.

References

9