Jacek Malinowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jacek Malinowski has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Tomasz Jarmużek
Departament of Logic, Nicolaus Copernicus University in Toruń
5 shared publications - Aleksander Parol
Uniwersytet Mikołaja Kopernika w Toruniu Wydział Filozofii i Nauk Społecznych, Toruń, Poland
2 shared publications - Agnieszka Sowińska
Nicolaus Copernicus University, Poland
1 shared publication Alina Strachocka
University of Warsaw
1 shared publicationAndrzej Grabowski
Jagiellonian University in Kraków
1 shared publicationAndrzej Kisielewicz
University of Wrocław
1 shared publication
Latest Publications
- Open Access
- 26 November 2025
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 34 (4) , 475-499
Jaśkowski’s Discovery and Various Ways to Master Contradictions
This paper presents the history of the world’s first school of paraconsistency: the Torunian School of Paraconsistent Logic. Its founding father is the Polish logician Stanisław Jaśkowski, who first formulated a system of paraconsistent logic. Both the approach he presented and the work of subsequent generations of logicians allow us to speak of the entire school. In this article, we present the characteristics of this school, comparing them with those of other national, but later, schools of paraconsistency. In addition to extensive factual information concerning Jaskowski’s discovery and subsequent development of this topic, we also refer to and comment on the latest works presented in this volume.
- 26 November 2025
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 34 (4) , 475-499
Open AccessJaśkowski’s Discovery and Various Ways to Master Contradictions
This paper presents the history of the world’s first school of paraconsistency: the Torunian School of Paraconsistent Logic. Its founding father is the Polish logician Stanisław Jaśkowski, who first formulated a system of paraconsistent logic. Both the approach he presented and the work of subsequent generations of logicians allow us to speak of the entire school. In this article, we present the characteristics of this school, comparing them with those of other national, but later, schools of paraconsistency. In addition to extensive factual information concerning Jaskowski’s discovery and subsequent development of this topic, we also refer to and comment on the latest works presented in this volume.
- 5 June 2025
- Published by Springer Nature in Studia Logica
- Vol. 113 (3) , 599-600
Open AccessObituary
- 2 February 2025
- Published by Springer Nature
- p. 111-127
A Variety of Connexive Logics in the Light of Relating Semantics
- 2 February 2025
- Published by Springer Nature
- p. 111-127
A Variety of Connexive Logics in the Light of Relating Semantics
- Open Access
Axiomatization of Boolean Connexive Logics with syncategorematic negation and modalities
In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining one is an extension of Modal Boolean Connexive Logic with a property of closure under the function of demodalization. In our work we provide a formal presentation of mentioned properties and axiom schemata that allow us to incorporate them into Hilbert-style calculi. The presented axiomatic systems are provided with proofs of soundness, completeness, and decidability. The properties of closure under negation and demodalization are motivated by the syncategorematic view on the connectives of negation and modalities, which is discussed in the paper.
Open AccessAxiomatization of Boolean Connexive Logics with syncategorematic negation and modalities
In the article we investigate three classes of extended Boolean Connexive Logics. Two of them are extensions of Modal and non-Modal Boolean Connexive Logics with a property of closure under an arbitrary number of negations. The remaining one is an extension of Modal Boolean Connexive Logic with a property of closure under the function of demodalization. In our work we provide a formal presentation of mentioned properties and axiom schemata that allow us to incorporate them into Hilbert-style calculi. The presented axiomatic systems are provided with proofs of soundness, completeness, and decidability. The properties of closure under negation and demodalization are motivated by the syncategorematic view on the connectives of negation and modalities, which is discussed in the paper.
- Open Access
- 21 June 2023
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 33 (4) , 509-522
Relating Semantics for Hyper-Connexive and Totally Connexive Logics
In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.
- 21 June 2023
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 33 (4) , 509-522
Open AccessRelating Semantics for Hyper-Connexive and Totally Connexive Logics
In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.
- 11 May 2022
- Published by Springer Nature in Studia Logica
- Vol. 110 (3) , 599
Obituary
- 25 February 2020
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 29 (2) , 239-258
Logic of Social Ontology and Łoś’s Operator
In 1947 Jerzy Łoś proposed a positional logic based on the realization operator. We follow his work and present it in the context of fundamental challenges of sociology such as the complexity of social reality and reflexivity of social agents. The paper is an outline of the general concept, as it opens a discussion and sets ground for future elaborations. In this paper, we are considering the concept according to which the expressions put forward by Łoś’s system might be indexed not only by spatial and temporal variables, but also by social contexts. And as such Łoś’s system might be a significant improvement, a valuable addition for social simulations and computational sociology, which use multi-agent systems and agent-based modeling. We consider how Łoś’s operator might be useful for these disciplines, as it gives a chance to combine of formalization with the humanistic coefficient, which represents the issues of complexity and reflexivity of social agents.
- 25 February 2020
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 29 (2) , 239-258
Logic of Social Ontology and Łoś’s Operator
In 1947 Jerzy Łoś proposed a positional logic based on the realization operator. We follow his work and present it in the context of fundamental challenges of sociology such as the complexity of social reality and reflexivity of social agents. The paper is an outline of the general concept, as it opens a discussion and sets ground for future elaborations. In this paper, we are considering the concept according to which the expressions put forward by Łoś’s system might be indexed not only by spatial and temporal variables, but also by social contexts. And as such Łoś’s system might be a significant improvement, a valuable addition for social simulations and computational sociology, which use multi-agent systems and agent-based modeling. We consider how Łoś’s operator might be useful for these disciplines, as it gives a chance to combine of formalization with the humanistic coefficient, which represents the issues of complexity and reflexivity of social agents.
- Open Access
- 30 October 2019
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 48 (3) , 213-243
Modal Boolean Connexive Logics: Semantics and Tableau Approach
In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. We construct these logics by mixing relating semantics with possible worlds. This way, we obtain connexive counterparts of basic normal modal logics. However, most of their traditional axioms formulated in terms of modalities and implication do not hold anymore without additional constraints, since our implication is weaker than the material one. In the final section, we present a tableau approach to the discussed modal logics.
- 30 October 2019
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 48 (3) , 213-243
Open AccessModal Boolean Connexive Logics: Semantics and Tableau Approach
In this paper we investigate Boolean connexive logics in a language with modal operators: □, ◊. In such logics, negation, conjunction, and disjunction behave in a classical, Boolean way. Only implication is non-classical. We construct these logics by mixing relating semantics with possible worlds. This way, we obtain connexive counterparts of basic normal modal logics. However, most of their traditional axioms formulated in terms of modalities and implication do not hold anymore without additional constraints, since our implication is weaker than the material one. In the final section, we present a tableau approach to the discussed modal logics.
- Open Access
- 22 June 2019
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Ruch Filozoficzny
- Vol. 75 (2) , 109-115
Paradoks golibrody i implikacja koneksywna
Paradoks golibrody i implikacja koneksywna
- 22 June 2019
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Ruch Filozoficzny
- Vol. 75 (2) , 109-115
Open AccessParadoks golibrody i implikacja koneksywna
Paradoks golibrody i implikacja koneksywna