default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHitoshi Omori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Heinrich Wansing
, Hitoshi Omori:
Connexive Logic, Connexivity, and Connexivism: Remarks on Terminology. Stud Logica 112(1-2): 1-35 (2024)- [j20]Hitoshi Omori, Andreas Kapsner:
Angell and McCall Meet Wansing. Stud Logica 112(1-2): 141-165 (2024) - [j19]Yang Song, Hitoshi Omori, Jonas R. Becker Arenhart, Satoshi Tojo:
A Generalization of Beall's Off-Topic Interpretation. Stud Logica 112(4): 893-932 (2024) - [j18]Jonas R. Becker Arenhart, Hitoshi Omori:
On Woodruff's Constructive Nonsense Logic. Stud Logica 112(6): 1261-1280 (2024) - 2022
- [c19]Damián Enrique Szmuc, Hitoshi Omori:
Liberating classical negation from falsity conditions. ISMVL 2022: 131-136 - [c18]Hitoshi Omori, Jonas Rafael Becker Arenhart:
Haack meets Herzberger and Priest. ISMVL 2022: 137-144 - [c17]Andreas Kapsner, Hitoshi Omori:
Superconnexivity Reconsidered. NCL 2022: 160-173 - [c16]Satoru Niki, Hitoshi Omori:
Another Combination of Classical and Intuitionistic Conditionals. NCL 2022: 174-188 - 2021
- [j17]Satoru Niki, Hitoshi Omori:
A note on Humberstone's constant Ω. Reports Math. Log. 56: 75-99 (2021) - [c15]Yang Song, Hitoshi Omori, Satoshi Tojo:
A two-valued semantics for infectious logics. ISMVL 2021: 50-55 - [c14]Hitoshi Omori, Daniel Skurt:
Untruth, falsity and non-deterministic semantics. ISMVL 2021: 74-80 - [c13]Hitoshi Omori, Jonas R. Becker Arenhart:
A Generalization of Ordered-Pair Semantics. LORI 2021: 149-157 - 2020
- [j16]Hitoshi Omori:
From logics of formal inconsistency to logics of formal classicality. Log. J. IGPL 28(5): 684-711 (2020) - [c12]Satoru Niki, Hitoshi Omori:
Actuality in Intuitionistic Logic. AiML 2020: 459-479 - [c11]Hitoshi Omori, Daniel Skurt:
A Semantics for a Failed Axiomatization of K. AiML 2020: 481-501 - [c10]Hitoshi Omori, Heinrich Wansing:
An Extension of Connexive Logic C. AiML 2020: 503-522
2010 – 2019
- 2019
- [c9]Hitoshi Omori, Daniel Skurt:
SIXTEEN _3 in Light of Routley Stars. WoLLIC 2019: 516-532 - 2018
- [j15]Michael De, Hitoshi Omori:
There is More to Negation than Modality. J. Philos. Log. 47(2): 281-299 (2018) - [j14]Hitoshi Omori, Heinrich Wansing:
On contra-Classical Variants of Nelson Logic N4 and its Classical Extension. Rev. Symb. Log. 11(4): 805-820 (2018) - [j13]Hitoshi Omori, Jesse Alama:
Axiomatizing Jaśkowski's Discussive Logic $$\mathbf {D_2}$$ D 2. Stud Logica 106(6): 1163-1180 (2018) - 2017
- [j12]Hitoshi Omori, Heinrich Wansing:
40 years of FDE: An Introductory Overview. Stud Logica 105(6): 1021-1049 (2017) - [c8]Norihiro Kamide, Hitoshi Omori:
An Extended First-Order Belnap-Dunn Logic with Classical Negation. LORI 2017: 79-93 - [c7]Hitoshi Omori, Damián Enrique Szmuc:
Conjunction and Disjunction in Infectious Logics. LORI 2017: 268-283 - [c6]Hitoshi Omori:
Sette's Logics, Revisited. LORI 2017: 451-465 - [c5]Andreas Kapsner, Hitoshi Omori:
Counterfactuals in Nelson Logic. LORI 2017: 497-511 - 2016
- [j11]Heinrich Wansing, Hitoshi Omori, Thomas Macaulay Ferguson:
Editorial Preface. FLAP 3(3): 279-296 (2016) - [j10]Hitoshi Omori:
A Simple Connexive Extension of the Basic Relevant Logic BD. FLAP 3(3): 467-478 (2016) - [j9]Hitoshi Omori:
A Note on Francez' Half-Connexive Formula. FLAP 3(3): 505-512 (2016) - [j8]Daniel Skurt, Hitoshi Omori:
More Modal Semantics without Possible Worlds. FLAP 3(5): 815-846 (2016) - [j7]Hitoshi Omori:
A Note on Wansing's expansion of Nelson's logic - a correction to "An axiomatization of Wansing's expansion of Nelson's logic". Reports Math. Log. 51: 133-144 (2016) - [c4]Michael De, Hitoshi Omori:
Classical and Empirical Negation in Subintuitionistic Logic. Advances in Modal Logic 2016: 217-235 - [c3]Hitoshi Omori:
Hallden's Logic of Nonsense and Its Expansions in View of Logics of Formal Inconsistency. DEXA Workshops 2016: 129-133 - 2015
- [j6]Hitoshi Omori:
An axiomatization of Wansing's expansion of Nelson's logic. Reports Math. Log. 50: 41-51 (2015) - [j5]Hitoshi Omori:
Remarks on Naive Set Theory based on LP. Rev. Symb. Log. 8(2): 279-295 (2015) - [j4]Michael De, Hitoshi Omori:
Classical Negation and Expansions of Belnap-Dunn Logic. Stud Logica 103(4): 825-851 (2015) - [j3]Hitoshi Omori, Katsuhiko Sano:
Generalizing Functional Completeness in Belnap-Dunn Logic. Stud Logica 103(5): 883-917 (2015) - 2014
- [j2]Katsuhiko Sano, Hitoshi Omori:
An expansion of first-order Belnap-Dunn logic. Log. J. IGPL 22(3): 458-481 (2014) - [c2]Michael De, Hitoshi Omori:
More on Empirical Negation. Advances in Modal Logic 2014: 114-133 - 2011
- [c1]Hitoshi Omori, Toshiharu Waragai:
Some Observations on the Systems LFI1 and LFI1. DEXA Workshops 2011: 320-324 - 2010
- [j1]Hitoshi Omori, Toshiharu Waragai:
A Note on Majkic's Systems. Notre Dame J. Formal Log. 51(4): 503-506 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
