TY - JOUR
AU - RESTALL, GA
Y2 - 2014/05/21
Y1 - 2005
SN - 1448-5052
UR - http://hdl.handle.net/11343/29126
AB - This paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a twoplace modal operator, the relevant conditional. The completeness proof is adapted from a proof for classical modal predicate logic (I follow James Garsonâ€™s presentation of the completeness proof quite closely [10]), but with an important twist, to do with the absence of Boolean negation.
PB - Victoria University of Wellington
KW - Philosophy
T1 - Constant domain quantified modal logics without Boolean negation
DO - 10.26686/ajl.v3i0.1772
IS - The Australasian Journal of Logic
VL - 3
SP - 45-62
L1 - /bitstream/handle/11343/29126/277611_43582.pdf?sequence=1&isAllowed=n
ER -