We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
his 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 two-place modal operator, the relevant conditional. The completeness proof is adapted from a proof for classical modal predicate logic (I follow James Garson’s 1984 presentation of the completeness proof quite closely), but with an important twist, to do with the absence of Boolean negation
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.