Connexive restricted quantification
This paper deals with \textit{connexive logics}, which are logics in which the implication is, unlike classical implication, connecting the antecdent and the succedent, much like relevant implication does. The questions asked regard the meaning \textit{restricted quantification} (RQ\(_{\forall}\)), \(\forall x. \phi\rightarrow \psi\) has, where \(\rightarrow\) is the implication of one of three connexive logics, the first two described in [\textit{H. Wansing}, in: Advances in modal logic. Vol. 5. Selected papers from the 5th conference (AiML 2004), Manchester, UK, September 9--11, 2004. London: King's College Publications. 367--383 (2005; Zbl 1107.03017)] and in [\textit{G. Priest}, Topoi 18, No. 2, 141--148 (1999; Zbl 0946.03011)], and the third is the author's variation of the second one, together with an investigation of the kind of connexive class theory (RQ\(_{\forall}\)) is inducing. While the application of (RQ\(_{\forall}\)) in the the first two connexive logics does not meet the yardstick for a connexive class theory, it does meet that yardstick for the author's own proposal of a connexive logic.
- A logic inspired by natural language: quantifiers as subnectors
- Connexive class logic
- Connexive modal logic
- Constructible falsity
- scientific article; zbMATH DE number 3162889 (Why is no real title available?)
- scientific article; zbMATH DE number 6868317 (Why is no real title available?)
- Logic: a history of its central concepts
- Logical pluralism
- Logics of nonsense and Parry systems
- Negation as cancellation, and connexive logic
- Relevant restricted quantification
This page was built for publication: Connexive restricted quantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656207)
