Papers
Topics
Authors
Recent
Search
2000 character limit reached

Mortensen Logics

Published 14 Apr 2022 in cs.LO | (2204.06731v1)

Abstract: Mortensen introduced a connexive logic commonly known as 'M3V'. M3V is obtained by adding a special conditional to LP. Among its most notable features, besides its being connexive, M3V is negation-inconsistent and it validates the negation of every conditional. But Mortensen has also studied and applied extensively other non-connexive logics, for example, closed set logic, CSL, and a variant of Sette's logic, identified and called 'P2' by Marcos. In this paper, we analyze and compare systematically the connexive variants of CSL and P2, obtained by adding the M3V conditional to them. Our main observations are two. First, that the inconsistency of M3V is exacerbated in the connexive variant of closed set logic, while it is attenuated in the connexive variant of the Sette-like P2. Second, that the M3V conditional is, unlike other conditionals, "connexively stable", meaning that it remains connexive when combined with the main paraconsistent negations.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.