Restricted arrow
The notion of restricted arrow has been introduced by Beall et al. to analyse restricted quantification, and is characterized as a particular relevant conditional by semantic means of a certain ternary relation in the so-called Routley-Meyer semantics for entailment. In this paper, the author presents a range of positive propositional substructural logics with the restricted arrow, and shows that they are also sound and complete with respect to suitably defined frameworks on the base of Routley-Meyer semantics. For the completeness proof, the usual one-step method by canonical model construction does not work. It is then carried out by a step-by-step method which has been applied for the completeness proof of some modal logics.
- An introduction to non-classical logic
- scientific article; zbMATH DE number 3496100 (Why is no real title available?)
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 1489632 (Why is no real title available?)
- scientific article; zbMATH DE number 1907195 (Why is no real title available?)
- Modal logic
- Negation in relevant logics. (How I stopped worrying and learned to love the Routley star)
- Positive modal logic
- Relevant restricted quantification
- The semantics of entailment. II
- The semantics of entailment. III
- Restricted CRCW PRAMs
- Naive structure, contraction and paradox
- Connexive restricted quantification
- Adding the relevant restricted quantification
- Transfinite numbers in paraconsistent set theory
- scientific article; zbMATH DE number 753776 (Why is no real title available?)
- Relevant restricted quantification
This page was built for publication: Restricted arrow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839646)