default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsuhiro Okada 0001
Mitsu Okada
Person information
- affiliation: Keio University, Tokyo, Japan
Other persons with the same name
- Mitsuhiro Okada 0002
![[0000-0001-8869-0760]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8869-0760")
— Hitachi, Japan (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2020
[j26]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theor. Comput. Sci. 817: 81-82 (2020)- [j25]Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada:
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. ACM Trans. Comput. Log. 21(1): 2:1-2:44 (2020) - 2016
- [j24]Mirja Helena Hartimo, Mitsuhiro Okada:
Syntactic reduction in Husserl's early phenomenology of arithmetic. Synth. 193(3): 937-969 (2016) - 2014
- [j23]Koji Mineshima, Yuri Sato, Ryo Takemura, Mitsuhiro Okada:
Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. J. Vis. Lang. Comput. 25(3): 156-169 (2014) - 2012
- [j22]Koji Mineshima, Mitsuhiro Okada, Ryo Takemura:
A Diagrammatic Inference System with Euler Circles. J. Log. Lang. Inf. 21(3): 365-391 (2012) - [j21]Koji Mineshima, Mitsuhiro Okada, Ryo Takemura:
A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations. Stud Logica 100(4): 753-785 (2012) - 2007
- [j20]Hirohiko Kushida, Mitsu Okada:
A proof-theoretic study of the correspondence of hybrid logic and classical logic. J. Log. Lang. Inf. 16(1): 35-61 (2007) - 2006
- [j19]Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui:
Intuitionistic phase semantics is almost classical. Math. Struct. Comput. Sci. 16(1): 67-86 (2006) - 2003
- [j18]Hirohiko Kushida, Mitsu Okada:
A proof-theoretic study of the correspondence of classical logic and modal logic. J. Symb. Log. 68(4): 1403-1414 (2003) - [j17]Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov:
Preface. Theor. Comput. Sci. 294(3): 333 (2003) - [j16]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003) - [j15]Misao Nagayama, Mitsuhiro Okada:
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Theor. Comput. Sci. 294(3): 551-573 (2003) - 2002
- [j14]Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi:
Theories of Types and Proofs 1997 - Preface. Theor. Comput. Sci. 272(1-2): 1-2 (2002) - [j13]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type systems. Theor. Comput. Sci. 272(1-2): 41-68 (2002) - [j12]Mitsuhiro Okada:
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. 281(1-2): 471-498 (2002) - 2001
- [j11]Misao Nagayama, Mitsuhiro Okada:
A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. J. Symb. Log. 66(4): 1524-1542 (2001) - 1999
- [j10]Mitsuhiro Okada, Kazushige Terui:
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. J. Symb. Log. 64(2): 790-802 (1999) - [j9]Mitsuhiro Okada:
Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. Theor. Comput. Sci. 227(1-2): 333-396 (1999) - 1998
- [j8]Masahiro Hamano, Mitsuhiro Okada:
A direct independence proof of Buchholz's Hydra Game on finite labeled trees. Arch. Math. Log. 37(2): 67-89 (1998) - 1997
- [j7]Masahiro Hamano, Mitsuhiro Okada:
A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. Math. Log. Q. 43: 103-120 (1997) - [j6]Jean-Pierre Jouannaud, Mitsuhiro Okada:
Abstract Data Type Systems. Theor. Comput. Sci. 173(2): 349-391 (1997) - 1990
- [j5]Nachum Dershowitz, Mitsuhiro Okada:
A Rationale for Conditional Equational Programming. Theor. Comput. Sci. 75(1&2): 111-138 (1990) - 1988
- [j4]Mitsuhiro Okada:
Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees. Eur. J. Comb. 9(3): 249-253 (1988) - [j3]Mitsuhiro Okada:
On a Theory of Weak Implications. J. Symb. Log. 53(1): 200-211 (1988) - 1987
- [j2]Mitsuhiro Okada:
A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. J. Symb. Log. 52(3): 577-581 (1987) - [j1]Mitsuhiro Okada:
A weak intuitionistic propositional logic with purely constructive implication. Stud Logica 46(4): 371-382 (1987)
Conference and Workshop Papers
- 2024
- [c41]Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada:
Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. ACL (Findings) 2024: 16063-16077 - [c40]Risako Ando, Kentaro Ozeki, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada:
Can Euler Diagrams Improve Syllogistic Reasoning in Large Language Models? Diagrams 2024: 232-248 - [c39]Masahiro Morii, Takashi Ideno, Yuki Tamari, Kazuhisa Takemura, Mitsuhiro Okada:
An Eye-Tracking Study on the Effects of Using Highlighted Multi-attribute Tables: A Preliminary Report. Diagrams 2024: 467-471 - [c38]Hirohiko Abe, Risako Ando, Takanobu Morishita, Kentaro Ozeki, Koji Mineshima, Mitsuhiro Okada:
Abductive Reasoning with Syllogistic Forms in Large Language Models. HAR 2024: 3-17 - 2020
- [c37]Mitsuhiro Okada:
A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems. Logic, Language, and Security 2020: 39-47 - [c36]Takashi Ideno, Masahiro Morii, Kazuhisa Takemura, Mitsuhiro Okada:
On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study. Diagrams 2020: 365-381 - [c35]Gergei Bana, Mitsuhiro Okada:
A Semantics for "Typically" in First-Order Default Reasoning. JSAI-isAI Workshops 2020: 3-20 - [c34]Mitsuhiro Okada, Yuta Takahashi:
A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems. WRLA@ETAPS 2020: 136-155 - 2018
- [c33]Mitsuhiro Okada, Yuta Takahashi:
On Quasi Ordinal Diagram Systems. TERMGRAPH@FSCD 2018: 38-49 - 2016
- [c32]Gergei Bana, Mitsuhiro Okada:
Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4. CSL 2016: 34:1-34:18 - 2013
- [c31]Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
Computationally complete symbolic attacker and key exchange. CCS 2013: 1231-1246 - [c30]Mitsuhiro Okada:
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). RTA 2013: 4-19 - [c29]Janna Hastings, Colin R. Batchelor, Mitsuhiro Okada:
Shape Perception in Chemistry. SHAPES 2013: 83-94 - 2012
- [c28]Yuri Sato, Koji Mineshima, Ryo Takemura, Mitsuhiro Okada:
On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective. ED@Diagrams 2012: 17-31 - [c27]Hiroki Mizosoe, Mitsuhiro Okada, Hironori Komi, Manabu Sasamoto, Yoshinori Hatori:
Very low-delay H.264 codec for consumer applications. ICCE 2012: 65-66 - 2010
- [c26]Koji Mineshima, Mitsuhiro Okada, Ryo Takemura:
Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. Diagrams 2010: 99-114 - 2009
- [c25]Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. Formal to Practical Security 2009: 33-56 - 2008
- [c24]Koji Mineshima, Mitsuhiro Okada, Yuri Sato, Ryo Takemura:
Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. Diagrams 2008: 188-205 - 2007
- [c23]Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
Computational Semantics for Basic Protocol Logic - A Stochastic Approach. ASIAN 2007: 86-94 - [c22]Mitsuhiro Okada, Ryo Takemura:
Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. Rewriting, Computation and Proof 2007: 167-181 - 2006
- [c21]Mitsuhiro Okada, Yutaro Sugimoto, Sumi Yoshikawa, Akihiko Konagaya:
Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. Essays Dedicated to Joseph A. Goguen 2006: 616-642 - 2005
- [c20]Koji Hasebe, Mitsuhiro Okada:
Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). RULE@RDP 2005: 73-92 - 2003
- [c19]Koji Hasebe, Mitsuhiro Okada:
Inferences on Honesty in Compositional Logic for Protocol Analysis. ISSS 2003: 65-86 - 2002
- [c18]Mitsuhiro Okada:
Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. Progress in Discovery Science 2002: 40-77 - [c17]Koji Hasebe, Mitsuhiro Okada:
A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. ISSS 2002: 417-440 - 1999
- [c16]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of algebraic Constructions. RTA 1999: 301-316 - 1998
- [c15]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Specifying Real-Time Finite-State Systems in Linear Logic. COTIC 1998: 42-59 - 1997
- [c14]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Phase semantics for light linear logic. MFPS 1997: 221-234 - 1996
- [c13]Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov:
Preface. Linear Logic Tokyo Meeting 1996: 1 - [c12]Misao Nagayama, Mitsuhiro Okada:
A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. Linear Logic Tokyo Meeting 1996: 153 - [c11]Mitsuhiro Okada:
Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. Linear Logic Tokyo Meeting 1996: 154 - 1993
- [c10]Yexuan Gui, Mitsuhiro Okada:
System Description of LAMBDALG - A Higher Order Algebraic Specification Language. LPAR 1993: 354-356 - [c9]Yexuan Gui, Mitsuhiro Okada:
LAMBDALG: Higher Order Algebraic Specification Language. RTA 1993: 462-466 - 1991
- [c8]Jean-Pierre Jouannaud, Mitsuhiro Okada:
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP 1991: 455-468 - [c7]Jean-Pierre Jouannaud, Mitsuhiro Okada:
A Computation Model for Executable Higher-Order Algebraic Specification Languages. LICS 1991: 350-361 - 1989
- [c6]Mitsuhiro Okada:
Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. ISSAC 1989: 357-363 - 1988
- [c5]Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar:
Canonical Conditional Rewrite Systems. CADE 1988: 538-549 - [c4]Nachum Dershowitz, Mitsuhiro Okada:
Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS 1988: 337-346 - [c3]Nachum Dershowitz, Mitsuhiro Okada:
Proof-Theoretic Techniques for Term Rewriting Theory. LICS 1988: 104-111 - 1987
- [c2]Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar:
Confluence of Conditional Rewrite Systems. CTRS 1987: 31-44 - [c1]Mitsuhiro Okada:
A Logical Analysis on Theory of Conditional Rewriting. CTRS 1987: 179-196
Editorship
- 2020
- [e6]Vivek Nigam, Tajana Ban Kirigin, Carolyn L. Talcott, Joshua D. Guttman, Stepan L. Kuznetsov, Boon Thau Loo, Mitsuhiro Okada:
Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 12300, Springer 2020, ISBN 978-3-030-62076-9 [contents] - 2009
- [e5]Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada:
Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration. Lecture Notes in Computer Science 5458, Springer 2009, ISBN 978-3-642-02001-8 [contents] - 2008
- [e4]Mitsu Okada, Ichiro Satoh:
Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues, 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4435, Springer 2008, ISBN 978-3-540-77504-1 [contents] - 2003
- [e3]Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa:
Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers. Lecture Notes in Computer Science 2609, Springer 2003, ISBN 3-540-00708-3 [contents] - 1996
- [e2]Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov:
Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29 - April 2, 1996. Electronic Notes in Theoretical Computer Science 3, Elsevier 1996 [contents] - 1991
- [e1]Stéphane Kaplan, Mitsuhiro Okada:
Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings. Lecture Notes in Computer Science 516, Springer 1991, ISBN 3-540-54317-1 [contents]
Informal and Other Publications
- 2025
- [i7]Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada:
Normative Reasoning in Large Language Models: A Comparative Benchmark from Logical and Modal Perspectives. CoRR abs/2510.26606 (2025) - 2024
- [i6]Kentaro Ozeki, Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada:
Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. CoRR abs/2408.04403 (2024) - 2023
- [i5]Risako Ando, Takanobu Morishita, Hirohiko Abe, Koji Mineshima, Mitsuhiro Okada:
Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases. CoRR abs/2306.12567 (2023) - 2010
- [i4]Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2010: 80 (2010) - 2007
- [i3]Gergei Bana, Koji Hasebe, Mitsuhiro Okada:
Computational Semantics for Basic Protocol Logic - A Stochastic Approach. IACR Cryptol. ePrint Arch. 2007: 156 (2007) - 2006
- [i2]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of Algebraic Constructions. CoRR abs/cs/0610063 (2006) - [i1]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type Systems. CoRR abs/cs/0610066 (2006)
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-11-20 00:31 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:
