Tomasz Jarmużek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tomasz Jarmużek has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Mateusz Klonowski
Department of Logic, Nicolaus Copernicus University in Toruń, Toruń, Poland
6 shared publications - Jacek Malinowski
Polish Academy of Sciences, Warszawa, Poland
5 shared publications - Aleksander Parol
Uniwersytet Mikołaja Kopernika w Toruniu Wydział Filozofii i Nauk Społecznych, Toruń, Poland
2 shared publications - Andrzej Pietruszczak
Department of Logic, Nicolaus Copernicus University in Toruń, Toruń, Poland
2 shared publications - Francesco Paoli
Consiglio per la Ricerca in Agricoltura e L’analisi Dell’economia Agraria (CREA), Centro di Ricerca Difesa e Certificazione (CREA DC), Cascine del Riccio, Via Lanciola 12/a, 50125 Firenze, Italy
2 shared publications - Piotr Kulicki
The John Paul II Catholic University of Lublin
2 shared publications
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.
- 4 November 2024
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 33 (6)
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.
- 4 November 2024
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 33 (6)
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 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
- 25 May 2023
- Published by Springer Nature in Studia Logica
- Vol. 112 (3) , 541-559
$\varvec{Brings~It~About~That}$ Operators Decomposed with Relating SemanticsIn the paper we examine the problem of logical systems that are extensions of Classical Propositional Logic with new, intensional connectives of agency: monadic and dyadic bringing it about that. These systems are usually studied within the neighbourhood semantics. Here we propose a different strategy. We study all of the accepted laws and rules of logic of agency and define a translation of the agency operators into connectives interpreted in relating semantics. After this translation we can make a reduction to more basic semantic properties that are required by the particular groups of laws and axioms. Finally, we define proper semantic structures and prove that they are complete with respect to all possible logical systems determined by the combinations of the axioms and rules.
- 25 May 2023
- Published by Springer Nature in Studia Logica
- Vol. 112 (3) , 541-559
Open Access$\varvec{Brings~It~About~That}$ Operators Decomposed with Relating SemanticsIn the paper we examine the problem of logical systems that are extensions of Classical Propositional Logic with new, intensional connectives of agency: monadic and dyadic bringing it about that. These systems are usually studied within the neighbourhood semantics. Here we propose a different strategy. We study all of the accepted laws and rules of logic of agency and define a translation of the agency operators into connectives interpreted in relating semantics. After this translation we can make a reduction to more basic semantic properties that are required by the particular groups of laws and axioms. Finally, we define proper semantic structures and prove that they are complete with respect to all possible logical systems determined by the combinations of the axioms and rules.
- Open Access
- 23 June 2022
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 51 (2) , 281-295
Tableaux for some deontic logics with the explicit permission operator
In this paper we present a tableau system for deontic logics with the operator of explicit permission. By means of this system the decidability of the considered logics can be proved. We will sketch how these logics are semantically defined by means of relating semantics and how they provide a simple solution to the free choice permission problem. In short, these logics employ relating implication and a certain propositional constant. These two are in turn used to define deontic operators similarly as in Andersonian-Kangerian reduction, which uses different intensional implications and constants.
- 23 June 2022
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 51 (2) , 281-295
Open AccessTableaux for some deontic logics with the explicit permission operator
In this paper we present a tableau system for deontic logics with the operator of explicit permission. By means of this system the decidability of the considered logics can be proved. We will sketch how these logics are semantically defined by means of relating semantics and how they provide a simple solution to the free choice permission problem. In short, these logics employ relating implication and a certain propositional constant. These two are in turn used to define deontic operators similarly as in Andersonian-Kangerian reduction, which uses different intensional implications and constants.
- Open Access
- 16 February 2022
- Published by Springer Nature in Logica Universalis
- Vol. 16 (1-2) , 195-219
Tableaux for Logics of Content Relationship and Set-Assignment Semantics
- 16 February 2022
- Published by Springer Nature in Logica Universalis
- Vol. 16 (1-2) , 195-219
Open AccessTableaux for Logics of Content Relationship and Set-Assignment Semantics
- Open Access
- 30 January 2022
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- p. 1-17
Applications of Relating Semantics
Here, we discuss logical, philosophical and technical problems associated to relating logic and relating semantics. To do so, we proceed in three steps. The first step is devoted to providing an introduction to both relating logic and relating semantics. We discuss this problem on the example of different languages. Second, we address some of the main research directions and their philosophical applications to non-classical logics, particularly to connexive logics. Third, we discuss some technical problems related to relating semantics, and its application to philosophy of science, language and pragmatics.
- 30 January 2022
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- p. 1-17
Open AccessApplications of Relating Semantics
Here, we discuss logical, philosophical and technical problems associated to relating logic and relating semantics. To do so, we proceed in three steps. The first step is devoted to providing an introduction to both relating logic and relating semantics. We discuss this problem on the example of different languages. Second, we address some of the main research directions and their philosophical applications to non-classical logics, particularly to connexive logics. Third, we discuss some technical problems related to relating semantics, and its application to philosophy of science, language and pragmatics.
- Open Access
- 30 January 2022
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- p. 1-29
Axiomatization of BLRI Determined by Limited Positive Relational Properties
In the paper a generalised method for obtaining an adequate axiomatic system for any relating logic expressed in the language with Boolean connectives and relating implication (BLRI), determined by the limited positive relational properties is studied. The method of defining axiomatic systems for logics of a given type is called an algorithm since the analysis allows for any logic determined by the limited positive relational properties to define the adequate axiomatic system automatically, step-by-step. We prove in the paper that the algorithm really works and we show how it can be applied to BLRI.
- 30 January 2022
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- p. 1-29
Open AccessAxiomatization of BLRI Determined by Limited Positive Relational Properties
In the paper a generalised method for obtaining an adequate axiomatic system for any relating logic expressed in the language with Boolean connectives and relating implication (BLRI), determined by the limited positive relational properties is studied. The method of defining axiomatic systems for logics of a given type is called an algorithm since the analysis allows for any logic determined by the limited positive relational properties to define the adequate axiomatic system automatically, step-by-step. We prove in the paper that the algorithm really works and we show how it can be applied to BLRI.
- Open Access
- 31 December 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 563-577
Relating Logic and Relating Semantics. History, Philosophical Applications and Some of Technical Problems
Here, we discuss historical, philosophical and technical problems associated with relating logic and relating semantics. To do so, we proceed in three steps. First, Section 1 is devoted to providing an introduction to both relating logic and relating semantics. Second, we address the history of relating semantics and some of the main research directions and their philosophical applications. Third, we discuss some technical problems related to relating semantics, particularly whether the direct incorporation of the relation into the language of relating logic is needed. The starting point for our considerations presented here is the 1st Workshop On Relating Logic and the selected papers for this issue.
- 31 December 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 563-577
Open AccessRelating Logic and Relating Semantics. History, Philosophical Applications and Some of Technical Problems
Here, we discuss historical, philosophical and technical problems associated with relating logic and relating semantics. To do so, we proceed in three steps. First, Section 1 is devoted to providing an introduction to both relating logic and relating semantics. Second, we address the history of relating semantics and some of the main research directions and their philosophical applications. Third, we discuss some technical problems related to relating semantics, particularly whether the direct incorporation of the relation into the language of relating logic is needed. The starting point for our considerations presented here is the 1st Workshop On Relating Logic and the selected papers for this issue.
- Open Access
- 28 November 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 711-739
Incorporating the Relation into the Language?
In this paper we discuss whether the relation between formulas in the relating model can be directly introduced into the language of relating logic, and present some stances on that problem. Other questions in the vicinity, such as what kind of functor would be the incorporated relation, or whether the direct incorporation of the relation into the language of relating logic is really needed, will also be addressed.
- 28 November 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 711-739
Open AccessIncorporating the Relation into the Language?
In this paper we discuss whether the relation between formulas in the relating model can be directly introduced into the language of relating logic, and present some stances on that problem. Other questions in the vicinity, such as what kind of functor would be the incorporated relation, or whether the direct incorporation of the relation into the language of relating logic is really needed, will also be addressed.