- 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
Completeness and Cut-Elimination for First-Order Ideal Paraconsistent Four-Valued Logic
Studia Logica 108 (3):549-571 (2020)
Abstract
In this study, we prove the completeness and cut-elimination theorems for a first-order extension F4CC of Arieli, Avron, and Zamansky’s ideal paraconsistent four-valued logic known as 4CC. These theorems are proved using Schütte’s method, which can simultaneously prove completeness and cut-elimination.Other Versions
No versions found
My notes
Similar books and articles
Modal extension of ideal paraconsistent four-valued logic and its subsystem.Norihiro Kamide & Yoni Zohar - 2020 - Annals of Pure and Applied Logic 171 (10):102830.
Kripke-Completeness and Cut-elimination Theorems for Intuitionistic Paradefinite Logics With and Without Quasi-Explosion.Norihiro Kamide - 2020 - Journal of Philosophical Logic 49 (6):1185-1212.
Completeness and cut-elimination theorems for trilattice logics.Norihiro Kamide & Heinrich Wansing - 2011 - Annals of Pure and Applied Logic 162 (10):816-835.
Symmetric and dual paraconsistent logics.Norihiro Kamide & Heinrich Wansing - 2010 - Logic and Logical Philosophy 19 (1-2):7-30.
An Extended Paradefinite Logic Combining Conflation, Paraconsistent Negation, Classical Negation, and Classical Implication: How to Construct Nice Gentzen-type Sequent Calculi.Norihiro Kamide - 2022 - Logica Universalis 16 (3):389-417.
Proof Systems Combining Classical and Paraconsistent Negations.Norihiro Kamide - 2009 - Studia Logica 91 (2):217-238.
Paraconsistent Double Negations as Classical and Intuitionistic Negations.Norihiro Kamide - 2017 - Studia Logica 105 (6):1167-1191.
Proof Theory of Paraconsistent Quantum Logic.Norihiro Kamide - 2018 - Journal of Philosophical Logic 47 (2):301-324.
Embedding Friendly First-Order Paradefinite and Connexive Logics.Norihiro Kamide - 2022 - Journal of Philosophical Logic 51 (5):1055-1102.
Analytics
Added to PP
2019-05-11
Downloads
25 (#727,051)
6 months
6 (#1,067,609)
2019-05-11
Downloads
25 (#727,051)
6 months
6 (#1,067,609)
Historical graph of downloads
Citations of this work
Embedding Friendly First-Order Paradefinite and Connexive Logics.Norihiro Kamide - 2022 - Journal of Philosophical Logic 51 (5):1055-1102.
References found in this work
Proof theory.Gaisi Takeuti - 1975 - New York, N.Y., U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Intuitive semantics for first-degree entailments and 'coupled trees'.J. Michael Dunn - 1976 - Philosophical Studies 29 (3):149-168.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
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-6b65f85844-pflvk uwo