Mateusz Klonowski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mateusz Klonowski has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Tomasz Jarmużek
Departament of Logic, Nicolaus Copernicus University in Toruń
6 shared publications - Krzysztof Aleksander Krawczyk
Jagiellonian University
2 shared publications - Luis Estrada-González
Institute for Philosophical Research, National Autonomous University of Mexico (UNAM)
2 shared publications - Piotr Kulicki
The John Paul II Catholic University of Lublin
2 shared publications - Alessandro Giordani
Catholic University of Milan
1 shared publication - Andrew Tedder
School of Chemistry and Biosciences, University of Bradford
1 shared publication
Latest Publications
- Open Access
- 20 September 2023
- Published by Springer Nature in Studia Logica
- Vol. 112 (1-2) , 207-248
Boolean Connexive Logic and Content Relationship
We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. In the first part, we also identify axioms of Epstein’s logics that, together with the connexive principles, lead to contradiction. Moreover, we present some principles that will be equivalent to the connexive theses, but not to the content connexive theses we will propose. In the second part, we focus on the semantic analysis provided by relating- and set-assignment models. We define sound and complete relating semantics for all tested systems. We also indicate alternative relating models for the smallest BCL, which are not alternative models of the connexive counterparts of the considered CRLs. We provide a set-assignment semantics for some BCLs, giving thus a natural formalization of the content relationship understood either as content sharing or as content inclusion.
- 20 September 2023
- Published by Springer Nature in Studia Logica
- Vol. 112 (1-2) , 207-248
Open AccessBoolean Connexive Logic and Content Relationship
We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. In the first part, we also identify axioms of Epstein’s logics that, together with the connexive principles, lead to contradiction. Moreover, we present some principles that will be equivalent to the connexive theses, but not to the content connexive theses we will propose. In the second part, we focus on the semantic analysis provided by relating- and set-assignment models. We define sound and complete relating semantics for all tested systems. We also indicate alternative relating models for the smallest BCL, which are not alternative models of the connexive counterparts of the considered CRLs. We provide a set-assignment semantics for some BCLs, giving thus a natural formalization of the content relationship understood either as content sharing or as content inclusion.
- 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-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
- 21 December 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 579-629
History of Relating Logic. The Origin and Research Directions
In this paper, we present the history of and the research directions in relating logic. For this purpose we will describe Epstein's Programme, which postulates accounting for the content of sentences in logical research. We will focus on analysing the content relationship and Epstein's logics that are based on it, which are special cases of relating logic. Moreover, the set-assignment semantics will be discussed. Next, the Torunian Programme of Relating Semantics will be presented; this programme explores the various non-logical relationships in logical research, including those which are content-related. We will present a general description of relating logic and semantics as well as the most prominent issues regarding the Torunian Programme, including some of its special cases and the results achieved to date.
- 21 December 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Logic and Logical Philosophy
- Vol. 30 (4) , 579-629
Open AccessHistory of Relating Logic. The Origin and Research Directions
In this paper, we present the history of and the research directions in relating logic. For this purpose we will describe Epstein's Programme, which postulates accounting for the content of sentences in logical research. We will focus on analysing the content relationship and Epstein's logics that are based on it, which are special cases of relating logic. Moreover, the set-assignment semantics will be discussed. Next, the Torunian Programme of Relating Semantics will be presented; this programme explores the various non-logical relationships in logical research, including those which are content-related. We will present a general description of relating logic and semantics as well as the most prominent issues regarding the Torunian Programme, including some of its special cases and the results achieved to date.
- 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.
- Open Access
- 13 November 2021
- Published by Springer Nature in Logica Universalis
- Vol. 15 (4) , 517-536
Axiomatization of Some Basic and Modal Boolean Connexive Logics
- 13 November 2021
- Published by Springer Nature in Logica Universalis
- Vol. 15 (4) , 517-536
Open AccessAxiomatization of Some Basic and Modal Boolean Connexive Logics
- Open Access
- 1 April 2021
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 50 (2) , 177-204
Tableau Systems for Epistemic Positional Logics
The goal of the article is twofold. The first one is to provide logics based on positional semantics which will be suitable for the analysis of epistemic modalities such as ‘agent ... knows/beliefs that ...’. The second one is to define tableau systemsfor such logics. Firstly, we present the minimal positional logic MR. Then, we change the notion of formulas and semantics in order to consider iterations of the operator of realization and “free” classical formulas. After that, we move on to weaker logics in order to avoid the well known problem of logical omniscience. At the same time, we keep the positional counterparts of modal axioms (T), (4) and (5). For all of the considered logics we present sound and complete tableau systems.
- 1 April 2021
- Published by Uniwersytet Lodzki (University of Lodz) in Bulletin of the Section of Logic
- Vol. 50 (2) , 177-204
Open AccessTableau Systems for Epistemic Positional Logics
The goal of the article is twofold. The first one is to provide logics based on positional semantics which will be suitable for the analysis of epistemic modalities such as ‘agent ... knows/beliefs that ...’. The second one is to define tableau systemsfor such logics. Firstly, we present the minimal positional logic MR. Then, we change the notion of formulas and semantics in order to consider iterations of the operator of realization and “free” classical formulas. After that, we move on to weaker logics in order to avoid the well known problem of logical omniscience. At the same time, we keep the positional counterparts of modal axioms (T), (4) and (5). For all of the considered logics we present sound and complete tableau systems.
- 2 February 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Studia z Historii Filozofii
- Vol. 11 (3) , 67-104
Epistemic Contextualism and Positional Logic
In the late 1940s, Jerzy Łoś published two works wherein he discussed logics with the realisation operator (later called positional logics). In these works, he investigated two interpretations of this operator: temporal and epistemic. In this article, we aim to develop and modify the epistemic interpretation so as to obtain a formalisation of epistemic contextualism, one of the most significant epistemological positions in contemporary times. According to this position, the logical value of epistemic sentences depends on contextually determined epistemic standards. We will demonstrate the advantage of such formalisation over previous attempts at the logical representation of epistemic contextualism.
- 2 February 2021
- Published by Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University in Studia z Historii Filozofii
- Vol. 11 (3) , 67-104
Epistemic Contextualism and Positional Logic
In the late 1940s, Jerzy Łoś published two works wherein he discussed logics with the realisation operator (later called positional logics). In these works, he investigated two interpretations of this operator: temporal and epistemic. In this article, we aim to develop and modify the epistemic interpretation so as to obtain a formalisation of epistemic contextualism, one of the most significant epistemological positions in contemporary times. According to this position, the logical value of epistemic sentences depends on contextually determined epistemic standards. We will demonstrate the advantage of such formalisation over previous attempts at the logical representation of epistemic contextualism.