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 simpl...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Lodz University Press
2022-06-01
|
| Series: | Bulletin of the Section of Logic |
| Subjects: | |
| Online Access: | https://czasopisma.uni.lodz.pl/bulletin/article/view/13227 |
| _version_ | 1811282170437697536 |
|---|---|
| author | Daniela Glavaničová Tomasz Jarmużek Mateusz Klonowski Piotr Kulicki |
| author_facet | Daniela Glavaničová Tomasz Jarmużek Mateusz Klonowski Piotr Kulicki |
| author_sort | Daniela Glavaničová |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T01:47:53Z |
| format | Article |
| id | doaj.art-cc221dfc265c428390869b91e6730615 |
| institution | Directory Open Access Journal |
| issn | 0138-0680 2449-836X |
| language | English |
| last_indexed | 2024-04-13T01:47:53Z |
| publishDate | 2022-06-01 |
| publisher | Lodz University Press |
| record_format | Article |
| series | Bulletin of the Section of Logic |
| spelling | doaj.art-cc221dfc265c428390869b91e67306152022-12-22T03:07:59ZengLodz University PressBulletin of the Section of Logic0138-06802449-836X2022-06-0151228129510.18778/0138-0680.2022.1113127Tableaux for some deontic logics with the explicit permission operatorDaniela Glavaničová0https://orcid.org/0000-0002-4189-9281Tomasz Jarmużek1https://orcid.org/0000-0003-3456-3859Mateusz Klonowski2https://orcid.org/0000-0001-8616-9189Piotr Kulicki3https://orcid.org/0000-0001-5413-3886Comenius University in Bratislava, Faculty of Arts, Department of Logic and Methodology of Sciences, 813 64, Gondova 2, Bratislava, SlovakiaNicolaus Copernicus University in Toruń, Faculty of Philosophy and Social Sciences, Department of Logic, 87-100, Stanisława Moniuszki 16/20 Toruń, Poland Nicolaus Copernicus University in Toruń, Faculty of Philosophy and Social Sciences, Department of Logic, 87-100, Stanisława Moniuszki 16/20 Toruń, Poland The John Paul II Catholic University of Lublin, Institute of Philosophy, Department of the Foundations of Computer Science, 20-950, Aleje Raclawickie 14, Lublin, Poland 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.https://czasopisma.uni.lodz.pl/bulletin/article/view/13227explicit permissionfree choicerelating semantics |
| spellingShingle | Daniela Glavaničová Tomasz Jarmużek Mateusz Klonowski Piotr Kulicki Tableaux for some deontic logics with the explicit permission operator Bulletin of the Section of Logic explicit permission free choice relating semantics |
| title | Tableaux for some deontic logics with the explicit permission operator |
| title_full | Tableaux for some deontic logics with the explicit permission operator |
| title_fullStr | Tableaux for some deontic logics with the explicit permission operator |
| title_full_unstemmed | Tableaux for some deontic logics with the explicit permission operator |
| title_short | Tableaux for some deontic logics with the explicit permission operator |
| title_sort | tableaux for some deontic logics with the explicit permission operator |
| topic | explicit permission free choice relating semantics |
| url | https://czasopisma.uni.lodz.pl/bulletin/article/view/13227 |
| work_keys_str_mv | AT danielaglavanicova tableauxforsomedeonticlogicswiththeexplicitpermissionoperator AT tomaszjarmuzek tableauxforsomedeonticlogicswiththeexplicitpermissionoperator AT mateuszklonowski tableauxforsomedeonticlogicswiththeexplicitpermissionoperator AT piotrkulicki tableauxforsomedeonticlogicswiththeexplicitpermissionoperator |