Hitoshi Omori
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
Hitoshi Omori has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Heinrich Wansing
Ruhr University Bochum
7 shared publications - Jonas Rafael Becker Arenhart
Department of Philosophy, Federal University of Santa Catarina, Santa Catarina, Brazil
5 shared publications - Katsuhiko Sano
Faculty of Humanities and Human Sciences, Hokkaido University, Sapporo, Japan
3 shared publications - Michael De
Utrecht University
3 shared publications - Damian Szmuc
University of Buenos Aires, Department of Philosophy, Argentina image/svg+xml
2 shared publications - Daniel Skurt
Ruhr University Bochum, Bochum, Germany
2 shared publications
Latest Publications
- Open Access
- 17 July 2025
- Published by Universidade Federal de Santa Catarina (UFSC) in Principia: an international journal of epistemology
- Vol. 29 (2) , 243-254
Is S5 Paraconsistent?
The aim of this note is to examine the claim of B´eziau that S5 is paraconsistent. In particular, I wish to clarify what exactly is implicitly assumed behind his claim, and how we might be able to assess the claim “S5 is paraconsistent”.
- 17 July 2025
- Published by Universidade Federal de Santa Catarina (UFSC) in Principia: an international journal of epistemology
- Vol. 29 (2) , 243-254
Open AccessIs S5 Paraconsistent?
The aim of this note is to examine the claim of B´eziau that S5 is paraconsistent. In particular, I wish to clarify what exactly is implicitly assumed behind his claim, and how we might be able to assess the claim “S5 is paraconsistent”.
- Open Access
- 2 February 2025
- Published by Springer Nature
- p. 1-22
A Note on the Historiography of Pre-modern Connexive Logic
The historiography of connexive logic has seen some pitfalls. In the present note, we show that the reception of principles characteristic of connexive logic provides an example of how an unwarranted bias in favor of what is now called ‘classical logic’ and an often accompanying aversion against contradictions can negatively affect the historiography of logic. Moreover, we briefly outline the coverage of the present volume 60 Years of Connexive Logic.
- 2 February 2025
- Published by Springer Nature
- p. 1-22
Open AccessA Note on the Historiography of Pre-modern Connexive Logic
The historiography of connexive logic has seen some pitfalls. In the present note, we show that the reception of principles characteristic of connexive logic provides an example of how an unwarranted bias in favor of what is now called ‘classical logic’ and an often accompanying aversion against contradictions can negatively affect the historiography of logic. Moreover, we briefly outline the coverage of the present volume 60 Years of Connexive Logic.
- Open Access
- 2 February 2025
- Published by Springer Nature
- p. 241-252
Ten Open Problems in Connexive Logic
In this short note, which is the final chapter of the volume 60 Years of Connexive Logic, we list ten open problems. Some of these problems are technical and precisely stated, while others are less technical and even speculative. We hope that the list inspires some readers to contribute to the field by tackling one or many of the problems.
- 2 February 2025
- Published by Springer Nature
- p. 241-252
Open AccessTen Open Problems in Connexive Logic
In this short note, which is the final chapter of the volume 60 Years of Connexive Logic, we list ten open problems. Some of these problems are technical and precisely stated, while others are less technical and even speculative. We hope that the list inspires some readers to contribute to the field by tackling one or many of the problems.
- Open Access
- 2 February 2025
- Published by Springer Nature
- p. 225-240
Another Generalization of Connexive Logic C
The present article aims at generalizing the approach to connexive logic thatwas initiated in [27], by following thework by Paul Egré and Guy Politzer. To this end, a variant of the connexive modal logic CK is introduced and some basic results including soundness and completeness results are established. A tableau calculus is also presented in an appendix.
- 2 February 2025
- Published by Springer Nature
- p. 225-240
Open AccessAnother Generalization of Connexive Logic C
The present article aims at generalizing the approach to connexive logic thatwas initiated in [27], by following thework by Paul Egré and Guy Politzer. To this end, a variant of the connexive modal logic CK is introduced and some basic results including soundness and completeness results are established. A tableau calculus is also presented in an appendix.
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 180-194
Kamide is in America, Moisil and Leitgeb are in Australia
It is not uncommon for a logic to be invented multiple times, hinting at its robustness. This trend is followed also by the expansion BD+ of Belnap-Dunn logic by Boolean negation. Ending up in the same logic, however, does not mean that the semantic interpretations are always the same as well. In particular, different interpretations can bring us to different logics, once the basic setting is moved from a classical one to an intuitionistic one. For BD+, two such paths seem to have been taken; one (BDi) by N. Kamide along the so-called American plan, and another (HYPE) by G. Moisil and H. Leitgeb along the so-called Australian plan. The aim of this paper is to better understand this divergence. This task is approached mainly by (i) formulating a semantics for first-order BD+ that provides an Australian view of the system; (ii) showing connections of the less explored (first-order) BDi with neighbouring systems, including an intermediate logic and variants of Nelson's logics.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 180-194
Open AccessKamide is in America, Moisil and Leitgeb are in Australia
It is not uncommon for a logic to be invented multiple times, hinting at its robustness. This trend is followed also by the expansion BD+ of Belnap-Dunn logic by Boolean negation. Ending up in the same logic, however, does not mean that the semantic interpretations are always the same as well. In particular, different interpretations can bring us to different logics, once the basic setting is moved from a classical one to an intuitionistic one. For BD+, two such paths seem to have been taken; one (BDi) by N. Kamide along the so-called American plan, and another (HYPE) by G. Moisil and H. Leitgeb along the so-called Australian plan. The aim of this paper is to better understand this divergence. This task is approached mainly by (i) formulating a semantics for first-order BD+ that provides an Australian view of the system; (ii) showing connections of the less explored (first-order) BDi with neighbouring systems, including an intermediate logic and variants of Nelson's logics.
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 244-256
The Power of Generalized Clemens Semantics
In this paper, we elaborate on the ordered-pair semantics originally presented by Matthew Clemens for LP (Priest's Logic of Paradox). For this purpose, we build on a generalization of Clemens semantics to the case of n-tuple semantics, for every n. More concretely, i) we deal with the case of a language with quantifiers, and ii) we consider philosophical implications of the semantics. The latter includes, first, a reading of the semantics in epistemic terms, involving multiple agents. Furthermore, we discuss the proper understanding of many-valued logics, namely LP and K3 (Kleene strong 3valued logic), from the perspective of classical logic, along the lines suggested by Susan Haack. We will also discuss some applications of the semantics to issues related to informative contradictions, i.e. contradictions involving quantification over different respects a vague predicate may have, as advanced by Paul Égré, and also to the mixed consequence relations, promoted by
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 244-256
Open AccessThe Power of Generalized Clemens Semantics
In this paper, we elaborate on the ordered-pair semantics originally presented by Matthew Clemens for LP (Priest's Logic of Paradox). For this purpose, we build on a generalization of Clemens semantics to the case of n-tuple semantics, for every n. More concretely, i) we deal with the case of a language with quantifiers, and ii) we consider philosophical implications of the semantics. The latter includes, first, a reading of the semantics in epistemic terms, involving multiple agents. Furthermore, we discuss the proper understanding of many-valued logics, namely LP and K3 (Kleene strong 3valued logic), from the perspective of classical logic, along the lines suggested by Susan Haack. We will also discuss some applications of the semantics to issues related to informative contradictions, i.e. contradictions involving quantification over different respects a vague predicate may have, as advanced by Paul Égré, and also to the mixed consequence relations, promoted by
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 229-243
A note on Grigoriev and Zaitsev's system CNL^2_4
The present article examines a system of four-valued logic recently introduced by Oleg Grigoriev and Dmitry Zaitsev. In particular, besides other interesting results, we will clarify the connection of this system to related systems developed by Paul Ruet and Norihiro Kamide. By doing so, we discuss two philosophical problems that arise from making such connections quite explicit: first, there is an issue with how to make intelligible the meaning of the connectives and the nature of the truth values involved in the many-valued setting employed-what we have called 'the Haackian theme'. We argue that this can be done in a satisfactory way, when seen according to the classicist's light. Second, and related to the first problem, there is a complication arising from the fact that the proof system advanced may be made sense of by advancing at least four such different and incompatible readings-a sharpening of the so-called 'Carnap problem'. We make explicit how the problems connect with each other precisely and argue that what results is a kind of underdetermination by the deductive apparatus for the system.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 229-243
Open AccessA note on Grigoriev and Zaitsev's system CNL^2_4
The present article examines a system of four-valued logic recently introduced by Oleg Grigoriev and Dmitry Zaitsev. In particular, besides other interesting results, we will clarify the connection of this system to related systems developed by Paul Ruet and Norihiro Kamide. By doing so, we discuss two philosophical problems that arise from making such connections quite explicit: first, there is an issue with how to make intelligible the meaning of the connectives and the nature of the truth values involved in the many-valued setting employed-what we have called 'the Haackian theme'. We argue that this can be done in a satisfactory way, when seen according to the classicist's light. Second, and related to the first problem, there is a complication arising from the fact that the proof system advanced may be made sense of by advancing at least four such different and incompatible readings-a sharpening of the so-called 'Carnap problem'. We make explicit how the problems connect with each other precisely and argue that what results is a kind of underdetermination by the deductive apparatus for the system.
- Open Access
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 257-270
The Disjunction-Free Fragment of D2 is Three-Valued
In this article, the disjunction-free fragment of Jaśkowski's discussive logic D 2 in the language of classical logic is shown to be complete with respect to three-and four-valued semantics. As a byproduct, a rather simple axiomatization of the disjunction-free fragment of D 2 is obtained. Some implications of this result are also discussed.
- 31 December 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 415, 257-270
Open AccessThe Disjunction-Free Fragment of D2 is Three-Valued
In this article, the disjunction-free fragment of Jaśkowski's discussive logic D 2 in the language of classical logic is shown to be complete with respect to three-and four-valued semantics. As a byproduct, a rather simple axiomatization of the disjunction-free fragment of D 2 is obtained. Some implications of this result are also discussed.
- 6 June 2024
- Published by Oxford University Press (OUP) in Analysis
- Vol. 84 (3) , 512-515
Should the negated conditional entail its antecedent?
We show that there is a simple derivation of triviality with very few assumptions involving the formula that the negated conditional entails the antecedent of the conditional.
- 6 June 2024
- Published by Oxford University Press (OUP) in Analysis
- Vol. 84 (3) , 512-515
Should the negated conditional entail its antecedent?
We show that there is a simple derivation of triviality with very few assumptions involving the formula that the negated conditional entails the antecedent of the conditional.