Mitsuhiro Okada

发表

Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable

Jean-Pierre Jouannaud, Mitsuhiro Okada, J. Jouannaud, 1991, ICALP.

The finite model property for various fragments of intuitionistic linear logic

Kazushige Terui, Mitsuhiro Okada, M. Okada, 1999, Journal of Symbolic Logic.

Some remarks on linear logic

Mitsuhiro Okada, 2008 .

Confluence of Conditional Rewrite Systems

Nachum Dershowitz, G. Sivakumar, Mitsuhiro Okada, 1988, CTRS.

Preface

Andre Scedrov, Jean-Yves Girard, Mitsuhiro Okada, 2010, Gene.

Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4

Mitsuhiro Okada, Gergei Bana, M. Okada, 2016, CSL.

On Quasi Ordinal Diagram Systems pdf

Yuta Takahashi, Mitsuhiro Okada, 2018, TERMGRAPH@FSCD.

Very low-delay H.264 codec for consumer applications

Yoshinori Hatori, Mitsuhiro Okada, Hiroki Mizosoe, 2012, 2012 IEEE International Conference on Consumer Electronics (ICCE).

Montague Grammatical Analysis of Japanese Case Particles

Mitsuhiro Okada, Kazue Watanabe, 1993 .

Intuitionistic phase semantics is almost classical

Kazushige Terui, Max I. Kanovich, Mitsuhiro Okada, 2006, Mathematical Structures in Computer Science.

Conditional and Typed Rewriting Systems

S. Kaplan, Mitsuhiro Okada, 1990, Lecture Notes in Computer Science.

Theories of Types and Proofs 1997 - Preface

Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi, 2002, Theor. Comput. Sci..

Conservativity for a hierarchy of Euler and Venn reasoning systems

Koji Mineshima, Mitsuhiro Okada, Ryo Takemura, 2009 .

Theories of Types and Proofs

Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi, 1998 .

Proof-theoretic techniques for term rewriting theory

Nachum Dershowitz, Mitsuhiro Okada, 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic

Mitsuhiro Okada, 1999, Theor. Comput. Sci..

A Logical Analysis on Theory of Conditional Rewriting

Mitsuhiro Okada, M. Okada, 1988, CTRS.

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Mitsuhiro Okada, M. Okada, 2002, Theor. Comput. Sci..

A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic

Mitsuhiro Okada, Misao Nagayama, 1996, Electron. Notes Theor. Comput. Sci..

Sony Media World

Koji Matsui, Mitsuhiro Okada, Takeshi Kubo, 2006 .

An Introduction to Linear Logic: Expressiveness and Phase Semantics

Mitsuhiro Okada, 1998 .

A Rationale for Conditional Equational Programming

Nachum Dershowitz, Mitsuhiro Okada, N. Dershowitz, 1990, Theor. Comput. Sci..

Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs

Mitsuhiro Okada, 1996, Electron. Notes Theor. Comput. Sci..

LAMBDALG: Higher Order Algebraic Specification Language

Mitsuhiro Okada, Yexuan Gui, M. Okada, 1993, RTA.

Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems

Mitsuhiro Okada, Stéphane Kaplan, 1990 .

An Open Source Client-Server System for the Analysis of Affymetrix Microarray Data

Mitsuhiro Okada, Lars Martin Jakt, Shin-Ichi Nishikawa, 2003 .

Canonical Conditional Rewrite Systems

Nachum Dershowitz, G. Sivakumar, Mitsuhiro Okada, 1988, CADE.

Formal to Practical Security - Papers Issued from the 2005-2008 French-Japanese Collaboration

Claude Kirchner, Véronique Cortier, Hideki Sakurada, 2009, Formal to Practical Security.

Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences

Sumi Yoshikawa, Akihiko Konagaya, Mitsuhiro Okada, 2006, Essays Dedicated to Joseph A. Goguen.

Software Security -- Theories and Systems: Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers

Mitsuhiro Okada, Isss, Nihon Gakujutsu Shinkōkai, 2003 .

Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols

Koji Hasebe, Mitsuhiro Okada, Gergei Bana, 2010, IACR Cryptol. ePrint Arch..

Shape Perception in Chemistry

Janna Hastings, Colin R. Batchelor, Mitsuhiro Okada, 2013, SHAPES.

Syntactic reduction in Husserl’s early phenomenology of arithmetic

Mitsuhiro Okada, Mirja Helena Hartimo, 2015, Synthese.

Towards new logic and semantics : Franco‐Japanese collaborative lectures on philosophy of logic

Jean-Yves Girard, Mitsuhiro Okada, Jocelyn Benoist, 2006 .

On Effects of Changing Multi-attribute Table Design on Decision Making: An Eye-Tracking Study

Mitsuhiro Okada, Kazuhisa Takemura, Takashi Ideno, 2020, Diagrams.

Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style

Koji Mineshima, Mitsuhiro Okada, Ryo Takemura, 2010, Diagrams.

Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective

Koji Mineshima, Yuri Sato, Mitsuhiro Okada, 2014, J. Vis. Lang. Comput..

Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system

Mitsuhiro Okada, M. Okada, 1989, ISSAC '89.

Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design

Koji Mineshima, Yuri Sato, Mitsuhiro Okada, 2008, Diagrams.

A weak intuitionistic propositional logic with purely constructive implication

Mitsuhiro Okada, M. Okada, 1987, Stud Logica.

Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)

Mitsuhiro Okada, M. Okada, 2013, RTA.

A computation model for executable higher-order algebraic specification languages

Jean-Pierre Jouannaud, Mitsuhiro Okada, J. Jouannaud, 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

STUDIES ON MANAGEMENT WORKS IN LAYING CAGE HOUSES (I)

Mitsuhiro Okada, Makio Yamada, Saburo Tohara, 1985 .

Computationally Complete Symbolic Adversary and Key Exchange

Koji Hasebe, Mitsuhiro Okada, Gergei Bana, 2014 .

Phase semantics for light linear logic

Max I. Kanovich, Andre Scedrov, Mitsuhiro Okada, 2003, MFPS.

A Small Remark on Hilbert's Finitist View of Divisibility and Kanovich-Okada-Scedrov's Logical Analysis of Real-Time Systems

Mitsuhiro Okada, 2020, Logic, Language, and Security.

Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems

Akinori Yonezawa, Benjamin C. Pierce, Hideyuki Tokuda, 2002 .

A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams

Mitsuhiro Okada, 1987, J. Symb. Log..

Computationally complete symbolic attacker and key exchange

Koji Hasebe, Mitsuhiro Okada, Gergei Bana, 2013, CCS.

A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic

Mitsuhiro Okada, Misao Nagayama, 2003, Theor. Comput. Sci..

Software Security — Theories and Systems

Akinori Yonezawa, Benjamin C. Pierce, Hideyuki Tokuda, 2003, Lecture Notes in Computer Science.

Computational Semantics for Basic Protocol Logic - A Stochastic Approach

Koji Hasebe, Mitsuhiro Okada, Gergei Bana, 2007, ASIAN.

Logic, Language, and Security: Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday

Boon Thau Loo, Tajana Ban Kirigin, Mitsuhiro Okada, 2020, Logic, Language, and Security.

Phase semantics for light linear logic

Max I. Kanovich, Andre Scedrov, Mitsuhiro Okada, 2003, Theor. Comput. Sci..

On the Cognitive Efficacy of Euler Diagrams in Syllogistic Reasoning: A Relational Perspective

Koji Mineshima, Yuri Sato, Mitsuhiro Okada, 2012, ED@Diagrams.

Specifying Real-Time Finite-State Systems in Linear Logic

Max I. Kanovich, Andre Scedrov, Mitsuhiro Okada, 1998, COTIC.

FPGA-accelerated Searchable Encrypted Database Management Systems for Cloud Services

Masanori Hariyama, Hasitha Muthumala Waidyasooriya, Mitsuhiro Okada, 2020 .

Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus

Mitsuhiro Okada, Ryo Takemura, M. Okada, 2007, Rewriting, Computation and Proof.

Theoretical Computer Science: Preface

Andre Scedrov, Mitsuhiro Okada, Jean Yves Girard, 2003 .

Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract)

Koji Hasebe, Mitsuhiro Okada, 2006, Electron. Notes Theor. Comput. Sci..

Denotational Semantics for interrogative Sentences in Japanese

Mitsuhiro Okada, Kazue Watanabe, 1993 .

Discussion on Some Methodologies for Applications of Ontology( Object Modeling in Philosophy and AI Research (4))

Mitsuhiro Okada, 2002 .

On a Theory of Weak Implications

Mitsuhiro Okada, 1988, J. Symb. Log..

Quantifying Quality of Actions Using Wearable Sensor

Andreas Dengel, Sheraz Ahmed, Mitsuhiro Okada, 2019, AALTD@PKDD/ECML.

A-6-7 Video Coding Based on Iteration of Overlapped Block Motion Compensation and Matching Pursuit : A Study on Adaptive Arithmetic Coding of MP Coefficients

Ichiro Matsuda, Susumu Itoh, Kazuyuki Morioka, 2005 .

Inferences on Honesty in Compositional Logic for Protocol Analysis

Koji Hasebe, Mitsuhiro Okada, 2003, ISSS.

A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems

Yuta Takahashi, Mitsuhiro Okada, 2020, WRLA@ETAPS.

A Diagrammatic Inference System with Euler Circles

Koji Mineshima, Mitsuhiro Okada, Ryo Takemura, 2012, Journal of Logic, Language and Information.

A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic

Koji Hasebe, Mitsuhiro Okada, 2002, ISSS.

Note on a Proof of the Extended Kirby - Paris Theorem on Labeled Finite Trees

Mitsuhiro Okada, M. Okada, 1988, Eur. J. Comb..

A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics

Mitsuhiro Okada, Misao Nagayama, 2001, J. Symb. Log..

Inductive-data-type systems

Jean-Pierre Jouannaud, Mitsuhiro Okada, Frédéric Blanqui, 2002, Theor. Comput. Sci..

A direct independence proof of Buchholz's Hydra Game on finite labeled trees

Mitsuhiro Okada, Masahiro Hamano, M. Okada, 1998, Arch. Math. Log..

Conditional Equational Programming and the Theory of Conditional Term Rewriting

Nachum Dershowitz, Mitsuhiro Okada, 1988, FGCS.

The Calculus of algebraic Constructions pdf

Jean-Pierre Jouannaud, Mitsuhiro Okada, Frédéric Blanqui, 1999, RTA.

Abstract Data Type Systems

Jean-Pierre Jouannaud, Mitsuhiro Okada, 1997, Theor. Comput. Sci..

Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert

Mitsuhiro Okada, 2002, Progress in Discovery Science.

Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols

Koji Hasebe, Mitsuhiro Okada, Gergei Bana, 2009, Formal to Practical Security.

A Generalized Syllogistic Inference System based on Inclusion and Exclusion Relations

Koji Mineshima, Mitsuhiro Okada, Ryo Takemura, 2012, Studia Logica.

Intuitive evidence and formal evidence in proof-formation (International Web Meeting of the 2nd Unit : Intuition and Reflection as Method of Philosophy)

Mitsuhiro Okada, 2013 .

System Description of LAMBDALG - A Higher Order Algebraic Specification Language

Mitsuhiro Okada, Yexuan Gui, M. Okada, 1993, LPAR.

A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game

Mitsuhiro Okada, Masahiro Hamano, M. Okada, 1995, Math. Log. Q..

Wittgenstein's Uniqueness Rule as an Elimination Rule of Inductive Types:

Mitsuhiro Okada, M. Okada, 2021 .

Non-monotonic Properties for Proving Correctness in a Framework of Compositional Logic �

Koji Hasebe, Mitsuhiro Okada, 2004 .

Completeness Proofs for Linear Logic Based on the Proof Search Method(Preliminary Report)(Type Theory and its Applications to Computer Systems)

Kazushige Terui, Mitsuhiro Okada, M. Okada, 1998 .

Effects of aging on hemispheric asymmetry in inferior frontal cortex activity during belief–bias syllogistic reasoning: A near-infrared spectroscopy study

Mitsuhiro Okada, Shigeru Watanabe, Takeo Tsujii, 2010, Behavioural Brain Research.

A Diagrammatic Reasoning System with Euler Circles

Koji Mineshima, Mitsuhiro Okada, Ryo Takemura, 2009 .

A note on rewriting theory for uniqueness of iteration.

Philip J. Scott, Mitsuhiro Okada, 1999 .