On a Suggested Logic for Paraconsistent Mathematics

Australasian Journal of Logic 22 (1):1-7 (2025)
  Copy   BIBTEX

Abstract

The logic subDL and its quantified extension subDLQ were proposed by Badia and Weber (Dialethism and its Applications, 2019: 155-176) as a basis for developing a version of mathematics in which paradoxes are harmless. In the present paper, subDL as defined in the literature is shown to be too strong to support the theories which motivate it. The crucial point is that contraction is derivable in subDL. It follows that the semantic structure used by Badia and Weber to invalidate contraction is not, in fact, a model of subDL. Here we identify the axioms responsible for contraction in subDL and prove that the logic, weakened by removal of these axioms, is contraction-free and paraconsistent.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,836

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Instability and Contraction: Méditations hégéliennes I.Elia Zardini - 2019 - Journal of Philosophical Logic 48 (1):155-188.
How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.
Semi-Contraction: Axioms and Construction.Eduardo Fermé & Ricardo Rodriguez - 1998 - Notre Dame Journal of Formal Logic 39 (3):332-345.
Replacement—A Sheffer Stroke for Belief Change.Sven Ove Hansson - 2009 - Journal of Philosophical Logic 38 (2):127-149.
A Representation Result for Value-based Contraction.Horacio Arló Costa & Hailin Liu - 2018 - Journal of Philosophical Logic 47 (6):965-989.
Relevant first-order logic LP# and Curry’s paradox resolution.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal Volume 4, Issue 1-1, January 2015 DOI: 10.11648/J.Pamj.S.2015040101.12.
Eligible Contraction.John Cantwell - 2003 - Studia Logica 73 (2):167-182.

Analytics

Added to PP
2025-01-16

Downloads
4 (#1,833,067)

6 months
4 (#979,456)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references