Heinrich Wansing
Research Subjects
Heinrich Wansing has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Yaroslav Shramko
Kryvyi Rih State Pedagogical University
6 shared publications - Norihiro Kamide
Waseda University
3 shared publications - Caroline Semmling
Dresden University of Technology
1 shared publication - David Makinson
London School of Economics & Political Science
1 shared publication - Jacek Malinowski
Polish Academy of Sciences, Warszawa, Poland
1 shared publication - Nuel Belnap
Department of Philosophy, University of Pittsburgh, Pittsburgh, USA
1 shared publication
Latest Publications
- Open Access
- 30 June 2010
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 19  (1-2) , 7-30
Symmetric and dual paraconsistent logics
Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistent logic (SPL) and dual paraconsistent logic (DPL), are introduced as Gentzen-type sequent calculi. The logic SPL is symmetric in the sense that the rule of contraposition is admissible in cut-free SPL. By using this symmetry property, a simpler cut-free sequent calculus for SPL is obtained. The logic DPL is not symmetric, but it has the duality principle. Simple semantics for SPL and DPL are introduced, and the completeness theorems with respect to these semantics are proved. The cut-elimination theorems for SPL and DPL are proved in two ways: One is a syntactical way which is based on the embedding theorems of SPL and DPL into Gentzen’s LK, and the other is a semantical way which is based on the completeness theorems.
- 30 June 2010
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 19  (1-2) , 7-30
Open AccessSymmetric and dual paraconsistent logics
Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistent logic (SPL) and dual paraconsistent logic (DPL), are introduced as Gentzen-type sequent calculi. The logic SPL is symmetric in the sense that the rule of contraposition is admissible in cut-free SPL. By using this symmetry property, a simpler cut-free sequent calculus for SPL is obtained. The logic DPL is not symmetric, but it has the duality principle. Simple semantics for SPL and DPL are introduced, and the completeness theorems with respect to these semantics are proved. The cut-elimination theorems for SPL and DPL are proved in two ways: One is a syntactical way which is based on the embedding theorems of SPL and DPL into Gentzen’s LK, and the other is a semantical way which is based on the completeness theorems.
- Open Access
- 26 June 2010
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 39  (4) , 341-344
Editorial Introduction
- 26 June 2010
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 39  (4) , 341-344
Open AccessEditorial Introduction
- 8 June 2010
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 39  (4) , 369-393
The Power of Belnap: Sequent Systems for SIXTEEN 3
- 8 June 2010
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 39  (4) , 369-393
The Power of Belnap: Sequent Systems for SIXTEEN 3
- 1 June 2010
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 16  (2) , 275-276
Nino B. Cocchiarella and Max A. Freund. Modal logic. An introduction to its syntax and semantics. Oxford University Press, Oxford, 2008, xi + 268 pp.
- 1 June 2010
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 16  (2) , 275-276
Nino B. Cocchiarella and Max A. Freund. Modal logic. An introduction to its syntax and semantics. Oxford University Press, Oxford, 2008, xi + 268 pp.
- 15 January 2010
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20  (6) , 1201-1229
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and 2006, Journal of Logic, Language and Information, 15, 403–424). In a first step, a logic I16 is presented as a Gentzen-type sequent calculus for an intuitionistic version of Odintsov’s Hilbert-style axiom system LT (Kamide and Wansing, 2009, Review of Symbolic Logic, 2, 374–395; Odintsov, 2009, Studia Logica, 91, 407–428). The cut-elimination theorem for I16 is proved using an embedding of I16 into Gentzen’s LJ. The completeness theorem with respect to a Kripke-style semantics is also proved for I16. The framework of I16 is regarded as plausible and natural for the following reasons: (i) the properties of constructible falsity and paraconsistency with respect to some negation connectives hold for I16, and (ii) sequent calculi for Belnap and Dunn’s four-valued logic (Anderson et al., 1992, Entailment: The Logic of Relevance and Necessity; Belnap, 1977, A useful four-valued logic, In Modern uses of Multiple Valued Logic, pp. 5–37; Dunn, 1976, Philosophical Studies, 29, 149–168) and for Nelson’s constructive four-valued logic (Almukdad and Nelson, 1984, Journal of Symbolic Logic, 49, 231–233) are included as natural subsystems of I16. In a second step, a logic IT16 is introduced as a tableau calculus. The tableau system IT16 is an intuitionistic counterpart of Odintsov’s axiom system for truth entailment ⊨t in SIXTEEN3 and of the sequent calculus for ⊨t presented in Wansing (2010, Journal of Philosophical Logic, to appear). The tableau calculus is also shown to be sound and complete with respect to a Kripke-style semantics. A tableau calculus for falsity entailment can be obtained by suitably modifying the notion of provability.
- 15 January 2010
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 20  (6) , 1201-1229
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and 2006, Journal of Logic, Language and Information, 15, 403–424). In a first step, a logic I16 is presented as a Gentzen-type sequent calculus for an intuitionistic version of Odintsov’s Hilbert-style axiom system LT (Kamide and Wansing, 2009, Review of Symbolic Logic, 2, 374–395; Odintsov, 2009, Studia Logica, 91, 407–428). The cut-elimination theorem for I16 is proved using an embedding of I16 into Gentzen’s LJ. The completeness theorem with respect to a Kripke-style semantics is also proved for I16. The framework of I16 is regarded as plausible and natural for the following reasons: (i) the properties of constructible falsity and paraconsistency with respect to some negation connectives hold for I16, and (ii) sequent calculi for Belnap and Dunn’s four-valued logic (Anderson et al., 1992, Entailment: The Logic of Relevance and Necessity; Belnap, 1977, A useful four-valued logic, In Modern uses of Multiple Valued Logic, pp. 5–37; Dunn, 1976, Philosophical Studies, 29, 149–168) and for Nelson’s constructive four-valued logic (Almukdad and Nelson, 1984, Journal of Symbolic Logic, 49, 231–233) are included as natural subsystems of I16. In a second step, a logic IT16 is introduced as a tableau calculus. The tableau system IT16 is an intuitionistic counterpart of Odintsov’s axiom system for truth entailment ⊨t in SIXTEEN3 and of the sequent calculus for ⊨t presented in Wansing (2010, Journal of Philosophical Logic, to appear). The tableau calculus is also shown to be sound and complete with respect to a Kripke-style semantics. A tableau calculus for falsity entailment can be obtained by suitably modifying the notion of provability.
- 1 December 2009
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 18  (6) , 921-935
Generalized truth values.: A reply to Dubois
Heinrich Wansing, Nuel Belnap; Generalized truth values.A reply to Dubois, Logic Journal of the IGPL, Volume 18, Issue 6, 1 December 2010, Pages 921–935, https
- 1 December 2009
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 18  (6) , 921-935
Generalized truth values.: A reply to Dubois
Heinrich Wansing, Nuel Belnap; Generalized truth values.A reply to Dubois, Logic Journal of the IGPL, Volume 18, Issue 6, 1 December 2010, Pages 921–935, https
- 30 June 2009
- Published by Springer Nature in Studia Logica
- Vol. 92  (2) , 143-146
Editorial Introduction. Truth Values: Part II
- 30 June 2009
- Published by Springer Nature in Studia Logica
- Vol. 92  (2) , 143-146
Editorial Introduction. Truth Values: Part II
- 1 June 2009
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 2  (2) , 374-395
SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
The trilattice SIXTEEN3 introduced in Shramko & Wansing (2005) is a natural generalization of the famous bilattice FOUR2. Some Hilbert-style proof systems for trilattice logics related to SIXTEEN3 have recently been studied (Odintsov, 2009; Shramko & Wansing, 2005). In this paper, three sequent calculi G B , F B , and Q B are presented for Odintsov’s (2009) first-degree proof system ⊢ B related to SIXTEEN3. The system G B is a standard Gentzen-type sequent calculus, F B is a four-place (horizontal) matrix sequent calculus, and Q B is a quadruple (vertical) matrix sequent calculus. In contrast with G B , the calculus F B satisfies the subformula property, and the calculus Q B reflects Odintsov’s coordinate valuations associated with valuations in SIXTEEN3. The equivalence between G B , F B , and Q B , the cut-elimination theorems for these calculi, and the decidability of ⊢ B are proved. In addition, it is shown how the sequent systems for ⊢ B can be extended to cut-free sequent calculi for Odintsov’s L B , which is an extension of ⊢ B by adding classical implication and negation connectives.
- 1 June 2009
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 2  (2) , 374-395
SEQUENT CALCULI FOR SOME TRILATTICE LOGICS
The trilattice SIXTEEN3 introduced in Shramko & Wansing (2005) is a natural generalization of the famous bilattice FOUR2. Some Hilbert-style proof systems for trilattice logics related to SIXTEEN3 have recently been studied (Odintsov, 2009; Shramko & Wansing, 2005). In this paper, three sequent calculi G B , F B , and Q B are presented for Odintsov’s (2009) first-degree proof system ⊢ B related to SIXTEEN3. The system G B is a standard Gentzen-type sequent calculus, F B is a four-place (horizontal) matrix sequent calculus, and Q B is a quadruple (vertical) matrix sequent calculus. In contrast with G B , the calculus F B satisfies the subformula property, and the calculus Q B reflects Odintsov’s coordinate valuations associated with valuations in SIXTEEN3. The equivalence between G B , F B , and Q B , the cut-elimination theorems for these calculi, and the decidability of ⊢ B are proved. In addition, it is shown how the sequent systems for ⊢ B can be extended to cut-free sequent calculi for Odintsov’s L B , which is an extension of ⊢ B by adding classical implication and negation connectives.
- 1 April 2009
- Published by Springer Nature in Studia Logica
- Vol. 91  (3) , 429-455
The Slingshot Argument and Sentential Identity
- 1 April 2009
- Published by Springer Nature in Studia Logica
- Vol. 91  (3) , 429-455
The Slingshot Argument and Sentential Identity
- 29 March 2009
- Published by Springer Nature in Studia Logica
- Vol. 91  (3) , 295-304
Editorial Introduction. Truth Values: Part I
- 29 March 2009
- Published by Springer Nature in Studia Logica
- Vol. 91  (3) , 295-304
Editorial Introduction. Truth Values: Part I