TY - JOUR
T1 - A non-deterministic view on non-classical negations
AU - Avron, Arnon
N1 - Funding Information:
Acknowledgment This research was supported by THE ISRAEL SCIENCE FOUNDATION (grant No 33/02-1).
PY - 2005/8
Y1 - 2005/8
N2 - We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for "the false") by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ +, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is based on non-deterministic four-valued or three-valued structures, and prove soundness and completeness for all of them. We show that the role of each rule is to reduce the degree of non-determinism in the corresponding systems. We also show that all the systems considered are decidable, and our semantics can be used for the corresponding decision procedures. Most of the extensions of LJ + (with or without ff) are shown to be conservative over the underlying logic, and it is determined which of them are not.
AB - We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for "the false") by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ +, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is based on non-deterministic four-valued or three-valued structures, and prove soundness and completeness for all of them. We show that the role of each rule is to reduce the degree of non-determinism in the corresponding systems. We also show that all the systems considered are decidable, and our semantics can be used for the corresponding decision procedures. Most of the extensions of LJ + (with or without ff) are shown to be conservative over the underlying logic, and it is determined which of them are not.
KW - Constructive Logics
KW - Many-valued Logics
KW - Negation
KW - Non-deterministic Semantics
KW - Paraconsistent Logics
UR - http://www.scopus.com/inward/record.url?scp=26444440400&partnerID=8YFLogxK
U2 - 10.1007/s11225-005-8468-5
DO - 10.1007/s11225-005-8468-5
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:26444440400
SN - 0039-3215
VL - 80
SP - 159
EP - 194
JO - Studia Logica
JF - Studia Logica
IS - 2-3
ER -