Search the dblp DataBase
Mitsuhiro Okada :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Mitsuhiro Okada , Yutaro Sugimoto , Sumi Yoshikawa , Akihiko Konagaya Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. [Citation Graph (0, 0)][DBLP ] Essays Dedicated to Joseph A. Goguen, 2006, pp:616-642 [Conf ] Nachum Dershowitz , Mitsuhiro Okada , G. Sivakumar Canonical Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CADE, 1988, pp:538-549 [Conf ] Mitsushiro Okada A Logical Analysis on Theory of Conditional Rewriting. [Citation Graph (0, 0)][DBLP ] CTRS, 1987, pp:179-196 [Conf ] Nachum Dershowitz , Mitsushiro Okada , G. Sivakumar Confluence of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP ] CTRS, 1987, pp:31-44 [Conf ] Mitsuhiro Okada Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. [Citation Graph (0, 0)][DBLP ] Progress in Discovery Science, 2002, pp:40-77 [Conf ] Nachum Dershowitz , Mitsuhiro Okada Conditional Equational Programming and the Theory of Conditional Term Rewriting. [Citation Graph (0, 0)][DBLP ] FGCS, 1988, pp:337-346 [Conf ] Jean-Pierre Jouannaud , Mitsuhiro Okada Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. [Citation Graph (0, 0)][DBLP ] ICALP, 1991, pp:455-468 [Conf ] Mitsuhiro Okada Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. [Citation Graph (0, 0)][DBLP ] ISSAC, 1989, pp:357-363 [Conf ] Koji Hasebe , Mitsuhiro Okada A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. [Citation Graph (0, 0)][DBLP ] ISSS, 2002, pp:417-440 [Conf ] Koji Hasebe , Mitsuhiro Okada Inferences on Honesty in Compositional Logic for Protocol Analysis. [Citation Graph (0, 0)][DBLP ] ISSS, 2003, pp:65-86 [Conf ] Nachum Dershowitz , Mitsuhiro Okada Proof-Theoretic Techniques for Term Rewriting Theory [Citation Graph (0, 0)][DBLP ] LICS, 1988, pp:104-111 [Conf ] Jean-Pierre Jouannaud , Mitsuhiro Okada A Computation Model for Executable Higher-Order Algebraic Specification Languages [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:350-361 [Conf ] Yexuan Gui , Mitsuhiro Okada System Description of LAMBDALG - A Higher Order Algebraic Specification Language. [Citation Graph (0, 0)][DBLP ] LPAR, 1993, pp:354-356 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada The Calculus of algebraic Constructions. [Citation Graph (0, 0)][DBLP ] RTA, 1999, pp:301-316 [Conf ] Yexuan Gui , Mitsuhiro Okada LAMBDALG: Higher Order Algebraic Specification Language. [Citation Graph (0, 0)][DBLP ] RTA, 1993, pp:462-466 [Conf ] Jean-Yves Girard , Mitsuhiro Okada , Andre Scedrov Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal ] Koji Hasebe , Mitsuhiro Okada Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:147, n:1, pp:73-92 [Journal ] Max I. Kanovich , Mitsuhiro Okada , Andre Scedrov Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:6, n:, pp:- [Journal ] Max I. Kanovich , Mitsuhiro Okada , Andre Scedrov Specifying Real-Time Finite-State Systems in Linear Logic. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1998, v:16, n:1, pp:- [Journal ] Misao Nagayama , Mitsuhiro Okada A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal ] Mitsuhiro Okada Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal ] Misao Nagayama , Mitsuhiro Okada A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2001, v:66, n:4, pp:1524-1542 [Journal ] Mitsuhiro Okada A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1987, v:52, n:3, pp:577-581 [Journal ] Mitsuhiro Okada On a Theory of Weak Implications. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1988, v:53, n:1, pp:200-211 [Journal ] Mitsuhiro Okada , Kazushige Terui The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1999, v:64, n:2, pp:790-802 [Journal ] Masahiro Hamano , Mitsuhiro Okada A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 1997, v:43, n:, pp:103-120 [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada Inductive-data-type systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:272, n:1-2, pp:41-68 [Journal ] Nachum Dershowitz , Mitsuhiro Okada A Rationale for Conditional Equational Programming. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:75, n:1&2, pp:111-138 [Journal ] Mariangiola Dezani-Ciancaglini , Mitsuhiro Okada , Masako Takahashi Theories of Types and Proofs 1997 - Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:272, n:1-2, pp:1-2 [Journal ] Jean-Yves Girard , Mitsuhiro Okada , Andre Scedrov Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:294, n:3, pp:333- [Journal ] Jean-Pierre Jouannaud , Mitsuhiro Okada Abstract Data Type Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:173, n:2, pp:349-391 [Journal ] Max I. Kanovich , Mitsuhiro Okada , Andre Scedrov Phase semantics for light linear logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:294, n:3, pp:525-549 [Journal ] Misao Nagayama , Mitsuhiro Okada A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:294, n:3, pp:551-573 [Journal ] Mitsuhiro Okada A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:281, n:1-2, pp:471-498 [Journal ] Mitsuhiro Okada Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:227, n:1-2, pp:333-396 [Journal ] Gergei Bana , Koji Hasebe , Mitsuhiro Okada Computational Semantics for Basic Protocol Logic - A Stochastic Approach. [Citation Graph (0, 0)][DBLP ] ASIAN, 2007, pp:86-94 [Conf ] Mitsuhiro Okada , Ryo Takemura Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. [Citation Graph (0, 0)][DBLP ] Rewriting, Computation and Proof, 2007, pp:167-181 [Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada The Calculus of Algebraic Constructions [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Frédéric Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada Inductive-data-type Systems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. [Citation Graph (, )][DBLP ] Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. [Citation Graph (, )][DBLP ] Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. [Citation Graph (, )][DBLP ] A direct independence proof of Buchholz's Hydra Game on finite labeled trees. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.490secs