The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mitsuhiro Okada: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
    Canonical Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:538-549 [Conf]
  3. Mitsushiro Okada
    A Logical Analysis on Theory of Conditional Rewriting. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:179-196 [Conf]
  4. Nachum Dershowitz, Mitsushiro Okada, G. Sivakumar
    Confluence of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:31-44 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Koji Hasebe, Mitsuhiro Okada
    Inferences on Honesty in Compositional Logic for Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    ISSS, 2003, pp:65-86 [Conf]
  11. Nachum Dershowitz, Mitsuhiro Okada
    Proof-Theoretic Techniques for Term Rewriting Theory [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:104-111 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. Yexuan Gui, Mitsuhiro Okada
    LAMBDALG: Higher Order Algebraic Specification Language. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:462-466 [Conf]
  16. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:3, n:, pp:- [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:3, pp:333- [Journal]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]

  40. Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. [Citation Graph (, )][DBLP]


  41. Two Types of Diagrammatic Inference Systems: Natural Deduction Style and Resolution Style. [Citation Graph (, )][DBLP]


  42. Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols. [Citation Graph (, )][DBLP]


  43. A direct independence proof of Buchholz's Hydra Game on finite labeled trees. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002