Confluence of Conditional Rewrite Systems. - Nachum Dershowitz; Mitsuhiro Okada; G. Sivakumar (CTRS, 1987)

A Logical Analysis on Theory of Conditional Rewriting. - Mitsuhiro Okada (CTRS, 1987)

A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. - Mitsuhiro Okada (J. Symb. Log., 1987)

A weak intuitionistic propositional logic with purely constructive implication. - Mitsuhiro Okada (Stud Logica, 1987)

Canonical Conditional Rewrite Systems. - Nachum Dershowitz; Mitsuhiro Okada; G. Sivakumar (CADE, 1988)

Conditional Equational Programming and the Theory of Conditional Term Rewriting. - Nachum Dershowitz; Mitsuhiro Okada (FGCS, 1988)

Proof-Theoretic Techniques for Term Rewriting Theory - Nachum Dershowitz; Mitsuhiro Okada (LICS, 1988)

Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees. - Mitsuhiro Okada (Eur. J. Comb., 1988)

On a Theory of Weak Implications. - Mitsuhiro Okada (J. Symb. Log., 1988)

Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. - Mitsuhiro Okada (ISSAC, 1989)

A Rationale for Conditional Equational Programming. - Nachum Dershowitz; Mitsuhiro Okada (Theor. Comput. Sci., 1990)

Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. - Jean-Pierre Jouannaud; Mitsuhiro Okada (ICALP, 1991)

A Computation Model for Executable Higher-Order Algebraic Specification Languages - Jean-Pierre Jouannaud; Mitsuhiro Okada (LICS, 1991)

System Description of LAMBDALG - A Higher Order Algebraic Specification Language. - Yexuan Gui; Mitsuhiro Okada (LPAR, 1993)

LAMBDALG: Higher Order Algebraic Specification Language. - Yexuan Gui; Mitsuhiro Okada (RTA, 1993)

Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. - Mitsuhiro Okada (Linear Logic Tokyo Meeting, 1996)

A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. - Masahiro Hamano; Mitsuhiro Okada (Math. Log. Q., 1997)

Abstract Data Type Systems. - Jean-Pierre Jouannaud; Mitsuhiro Okada (Theor. Comput. Sci., 1997)

A direct independence proof of Buchholz's Hydra Game on finite labeled trees. - Masahiro Hamano; Mitsuhiro Okada (Arch. Math. Log., 1998)

Specifying Real-Time Finite-State Systems in Linear Logic. - Max I. Kanovich; Mitsuhiro Okada; Andre Scedrov (COTIC, 1998)

The Calculus of algebraic Constructions. - Frédéric Blanqui; Jean-Pierre Jouannaud; Mitsuhiro Okada (RTA, 1999)

The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. - Mitsuhiro Okada; Kazushige Terui (J. Symb. Log., 1999)

Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. - Mitsuhiro Okada (Theor. Comput. Sci., 1999)

A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. - Misao Nagayama; Mitsuhiro Okada (J. Symb. Log., 2001)

Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. - Mitsuhiro Okada (Progress in Discovery Science, 2002)

A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. - Koji Hasebe; Mitsuhiro Okada (ISSS, 2002)

Inductive-data-type systems. - Frédéric Blanqui; Jean-Pierre Jouannaud; Mitsuhiro Okada (Theor. Comput. Sci., 2002)

Theories of Types and Proofs 1997 - Preface. - Mariangiola Dezani-Ciancaglini; Mitsuhiro Okada; Masako Takahashi (Theor. Comput. Sci., 2002)

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. - Mitsuhiro Okada (Theor. Comput. Sci., 2002)

Inferences on Honesty in Compositional Logic for Protocol Analysis. - Koji Hasebe; Mitsuhiro Okada (ISSS, 2003)

Preface. - Jean-Yves Girard 001; Mitsuhiro Okada; Andre Scedrov (Theor. Comput. Sci., 2003)

Phase semantics for light linear logic. - Max I. Kanovich; Mitsuhiro Okada; Andre Scedrov (Theor. Comput. Sci., 2003)

A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. - Misao Nagayama; Mitsuhiro Okada (Theor. Comput. Sci., 2003)

Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). - Koji Hasebe; Mitsuhiro Okada (RULE@RDP, 2005)

Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. - Mitsuhiro Okada; Yutaro Sugimoto; Sumi Yoshikawa; Akihiko Konagaya (Essays Dedicated to Joseph A. Goguen, 2006)

Intuitionistic phase semantics is almost classical. - Max I. Kanovich; Mitsuhiro Okada; Kazushige Terui (Math. Struct. Comput. Sci., 2006)

Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. - Mitsuhiro Okada; Ryo Takemura (Rewriting, Computation and Proof, 2007)

Computational Semantics for Basic Protocol Logic - A Stochastic Approach. - Gergei Bana; Koji Hasebe; Mitsuhiro Okada (IACR Cryptol. ePrint Arch., 2007)

Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. - Koji Mineshima; Mitsuhiro Okada; Yuri Sato 001; Ryo Takemura (Diagrams, 2008)

Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. - Gergei Bana; Koji Hasebe; Mitsuhiro Okada (Formal to Practical Security, 2009)

Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. - Koji Mineshima; Mitsuhiro Okada; Ryo Takemura (Diagrams, 2010)

Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols. - Gergei Bana; Koji Hasebe; Mitsuhiro Okada (IACR Cryptol. ePrint Arch., 2010)

On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective. - Yuri Sato 001; Koji Mineshima; Ryo Takemura; Mitsuhiro Okada (ED@Diagrams, 2012)

Very low-delay H.264 codec for consumer applications. - Hiroki Mizosoe; Mitsuhiro Okada; Hironori Komi; Manabu Sasamoto; Yoshinori Hatori (ICCE, 2012)

A Diagrammatic Inference System with Euler Circles. - Koji Mineshima; Mitsuhiro Okada; Ryo Takemura (J. Log. Lang. Inf., 2012)

A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations. - Koji Mineshima; Mitsuhiro Okada; Ryo Takemura (Stud Logica, 2012)

Computationally complete symbolic attacker and key exchange. - Gergei Bana; Koji Hasebe; Mitsuhiro Okada (CCS, 2013)

Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk). - Mitsuhiro Okada (RTA, 2013)

Shape Perception in Chemistry. - Janna Hastings; Colin R. Batchelor; Mitsuhiro Okada (SHAPES, 2013)

Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. - Koji Mineshima; Yuri Sato 001; Ryo Takemura; Mitsuhiro Okada (J. Vis. Lang. Comput., 2014)

Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4. - Gergei Bana; Mitsuhiro Okada (CSL, 2016)

Syntactic reduction in Husserl's early phenomenology of arithmetic. - Mirja Helena Hartimo; Mitsuhiro Okada (Synth., 2016)

On Quasi Ordinal Diagram Systems. - Mitsuhiro Okada; Yuta Takahashi (TERMGRAPH@FSCD, 2018)

Quantifying Quality of Actions Using Wearable Sensor. - Mohammad Al-Naser; Takehiro Niikura; Sheraz Ahmed; Hiroki Ohashi; Takuto Sato; Mitsuhiro Okada; Katsuyuki Nakamura; Andreas Dengel 001 (AALTD@PKDD/ECML, 2019)

A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems. - Mitsuhiro Okada (Logic, Language, and Security, 2020)

On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study. - Takashi Ideno; Masahiro Morii; Kazuhisa Takemura; Mitsuhiro Okada (Diagrams, 2020)

A Semantics for "Typically" in First-Order Default Reasoning. - Gergei Bana; Mitsuhiro Okada (JSAI-isAI Workshops, 2020)

A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems. - Mitsuhiro Okada; Yuta Takahashi (WRLA@ETAPS, 2020)

Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. - Frédéric Blanqui; Jean-Pierre Jouannaud; Mitsuhiro Okada (Theor. Comput. Sci., 2020)

Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. - Gergei Bana; Rohit Chadha; Ajay Kumar Eeralla; Mitsuhiro Okada (ACM Trans. Comput. Log., 2020)

Sensor-Augmented Egocentric-Video Captioning with Dynamic Modal Attention. - Katsuyuki Nakamura; Hiroki Ohashi; Mitsuhiro Okada (ACM Multimedia, 2021)

FPGA-Accelerated Searchable Encrypted Database Management Systems for Cloud Services. - Mitsuhiro Okada; Takayuki Suzuki; Naoya Nishio; Hasitha Muthumala Waidyasooriya; Masanori Hariyama (IEEE Trans. Cloud Comput., 2022)

Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases. - Risako Ando; Takanobu Morishita; Hirohiko Abe; Koji Mineshima; Mitsuhiro Okada (CoRR, 2023)

Exploring Reasoning Biases in Large Language Models Through Syllogism: Insights from the NeuBAROCO Dataset. - Kentaro Ozeki; Risako Ando; Takanobu Morishita; Hirohiko Abe; Koji Mineshima; Mitsuhiro Okada (ACL (Findings), 2024)

Can Euler Diagrams Improve Syllogistic Reasoning in Large Language Models? - Risako Ando; Kentaro Ozeki; Takanobu Morishita; Hirohiko Abe; Koji Mineshima; Mitsuhiro Okada (Diagrams, 2024)

An Eye-Tracking Study on the Effects of Using Highlighted Multi-attribute Tables: A Preliminary Report. - Masahiro Morii; Takashi Ideno; Yuki Tamari; Kazuhisa Takemura; Mitsuhiro Okada (Diagrams, 2024)

Abductive Reasoning with Syllogistic Forms in Large Language Models. - Hirohiko Abe; Risako Ando; Takanobu Morishita; Kentaro Ozeki; Koji Mineshima; Mitsuhiro Okada (HAR, 2024)