- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On Béziau’s logic Z
Logic and Logical Philosophy 17 (4):305-320 (2008)
Abstract
In [1] Béziau developed the paraconsistent logic Z, which is definitionally equivalent to the modal logic S5, and gave an axiomatization of the logic Z: the system HZ. In the present paper, we prove that some axioms of HZ are not independent and then propose another axiomatization of Z. We also discuss a new perspective on the relation between S5 and classical propositional logic with the help of the new axiomatization of Z. Then we conclude the paper by making a remark on the paraconsistency of HZAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
Weakening and Extending {mathbb{Z}}.Mauricio Osorio, J. L. Carballido, C. Zepeda & J. A. Castellanos - 2015 - Logica Universalis 9 (3):383-409.
Three-valued logics in modal logic.Barteld Kooi & Allard Tamminga - 2013 - Studia Logica 101 (5):1061-1072.
Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.
A Modal Supervaluation Description Logic For Characterization Of Vague Concepts: Its Semantics And A Tableau Algorithm For It.Lei Liu & Lin Chen - 2006 - Logic Journal of the IGPL 14 (6):873-888.
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151-177.
Actuality in Propositional Modal Logic.Allen P. Hazen, Benjamin G. Rin & Kai F. Wehmeier - 2013 - Studia Logica 101 (3):487-503.
An alternative proof of the Hilbert-style axiomatization for the $$\{\wedge,\vee \}$$ { ∧, ∨ } -fragment of classical propositional logic.Luciano J. González - 2022 - Archive for Mathematical Logic 61 (5):859-865.
Obtaining infinitely many degrees of inconsistency by adding a strictly paraconsistent negation to classical logic.Peter Verdée - 2020 - Synthese 198 (S22):5415-5449.
Analytics
Added to PP
2013-11-24
Downloads
117 (#184,923)
6 months
15 (#212,111)
2013-11-24
Downloads
117 (#184,923)
6 months
15 (#212,111)
Historical graph of downloads
Author's Profile
Citations of this work
Revisiting $\mathbb{Z}$.Mauricio Osorio, José Luis Carballido & Claudia Zepeda - 2014 - Notre Dame Journal of Formal Logic 55 (1):129-155.
References found in this work
A propositional calculus for inconsistent deductive systems.Stanisław Jaśkowski - 1999 - Logic and Logical Philosophy 7:35.
The paraconsistent logic Z. A possible solution to Jaśkowski's problem.Jean-Yves Béziau - 2006 - Logic and Logical Philosophy 15 (2):99-111.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-mnmvz uwo