[1]
Mirja Hartimo and Mitsuhiro Okada. Syntactic reduction in husserl's early phenomenology of arithmetic. Synthese, accepted, 2015. [ bib ]
[2]
Koji Mineshima, Yuri Sato, Ryo Takemura, and Mitsuhiro Okada. Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. Journal of Visual Languages and Computing, 25(3):156--169, 2014. [ bib | DOI | http ]
[3]
Mathieu Marion and Mitsuhiro Okada. Wittgenstein on equinumerosity and surveyability. Grazer Philosophische Studien, 89:59--76, 2014. [ bib ]
[4]
Mathieu Marion and Mitsuhiro Okada. Wittgenstein on contradiction and consistency: An overview. O Que Nos Faz Pensar, 33:50--79, June 2013. [ bib ]
[5]
Gergei Bana, Koji Hasebe, and Mitsuhiro Okada. Computationally complete symbolic attacker and key exchange. In 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013, pages 1231--1246, 2013. [ bib | DOI | http ]
[6]
Mitsuhiro Okada. Husserl and hilbert on completeness and husserl's term rewrite-based theory of multiplicity (invited talk). In 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands, pages 4--19, 2013. [ bib | DOI | http ]
[7]
Janna Hastings, Colin R. Batchelor, and Mitsuhiro Okada. Shape perception in chemistry. In Proceedings of the Second Interdisciplinary Workshop The Shape of Things, Rio de Janeiro, Brazil, April 3-4, 2013, pages 83--94, 2013. [ bib | .pdf ]
[8]
Juko Ando, Keiko K Fujisawa, Chizuru Shikishima, Kai Hiraishi, Mari Nozaki, Shinji Yamagata, Yusuke Takahashi, Koken Ozaki, Kunitake Suzuki, Minako Deno, et al. Two cohort and three independent anonymous twin projects at the keio twin research center (kotrec). Twin Research and Human Genetics, 16(01):202--216, 2013. [ bib ]
[9]
Koji Mineshima, Mitsuhiro Okada, Yuri Sato, and Ryo Takemura. Logic and cognition in reasoning with Euler diagrams: A relational perspective., volume 5 of CARLS Series of Advanced Study of Logic and Sensibility, pages 283--300. Keio University Press, 2012. [ bib ]
[10]
Koji Mineshima, Mitsuhiro Okada, and Ryo Takemura. A diagrammatic inference system with Euler circles. Journal of Logic, Language and Information, 21(3):365--391, 2012. [ bib | DOI | http ]
[11]
Koji Mineshima, Mitsuhiro Okada, and Ryo Takemura. A generalized syllogistic inference system based on inclusion and exclusion relations. Studia Logica, 100(4):753--785, 2012. [ bib | DOI | http ]
[12]
Koji Mineshima, Yuri Sato, Ryo Takemura, and Mitsuhiro Okada. On the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. In Proceedings of the 3rd international workshop on euler diagrams (euler diagrams 2012), CEUR Workshop Proceedings, volume 854, pages 17--31, 2012. [ bib ]
[13]
佐藤 有理, 峯島 宏次, 竹村 亮, and 岡田 光弘. 図形を用いた演繹的推論の認知プロセス. In 日本認知科学会第28回大会論文集, pages 269--274, 2011. [ bib ]
[14]
峯島 宏次, 岡田 光弘, 佐藤 有理, and 竹村 亮. オイラー図・ヴェン図を用いた図形推論の証明論的分析. In 第24回人工知能学会全国大会論文集, number 1E1-4, pages pp.1--4, 2010. [ bib ]
[15]
Gergei Bana, Koji Hasebe, and Mitsuhiro Okada. Secrecy-oriented first-order logical analysis of cryptographic protocols. IACR Cryptology ePrint Archive, 2010:80, 2010. [ bib | http ]
[16]
Koji Mineshima, Mitsuhiro Okada, and Ryo Takemura. Two types of diagrammatic inference systems: Natural deduction style and resolution style. In Diagrammatic Representation and Inference, 6th International Conference, Diagrams 2010, Portland, OR, USA, August 9-11, 2010. Proceedings, pages 99--114, 2010. [ bib | DOI | http ]
[17]
Koji Mineshima, Mitsuhiro Okada, Yuri Sato, and Ryo Takemura. A report on Euler diagrammatic reasoning system: theory and experiment design., volume 2, pages 387--402. Keio University Press, 2009. [ bib ]
[18]
Koji Mineshima, Mitsuhiro Okada, and Ryo Takemura. Conservativity for a hierarchy of Euler and Venn reasoning systems. Proceedings of Visual Languages and Logic 2009, pages 37--61, 2009. [ bib ]
[19]
Mitsuhiro Okada. A note on husserl's arguments for the completeness of arithmetic. In Mirja Helena Hartimo, editor, Phenomenology and Mathematics, Phaenomenologica. Springer, Dordrect, 2009. [ bib ]
[20]
Gergei Bana, Koji Hasebe, and Mitsuhiro Okada. Computational semantics for first-order logical analysis of cryptographic protocols. In Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, and Hideki Sakurada, editors, Formal to Practical Security Papers Issued from the 2005-2008 French-Japanese Collaboration, volume 5458 of Lecture Notes in Computer Science, pages 33--56. Springer, jun 2009. [ bib ]
[21]
Chizuru Shikishima, Kai Hiraishi, Shinji Yamagata, Yutaro Sugimoto, Ryo Takemura, Mitsuhiro Okada, Tatsushi Toda, and Juko Ando. Is g an entity? A japanese twin study using syllogisms and intelligence tests. Intelligence, 37(3):256--267, may 2009. [ bib ]
[22]
Mitsuhiro Okada, editor. Ontology and Phenomenology. Keio University Open Research Centre for Logic and Ontology, Keio University Press, mar 2009. [ bib ]
[23]
Mitsuhiro Okada and Shigeyuki Nakayama. Husserlian “manifold” and tarskian “model” for formal logic (extended abstract). In Okada and Smith [24]. [ bib ]
[24]
Mitsuhiro Okada and Barry Smith, editors. Interdisciplinary Ontology vol.2 (Proceedings of the Second Interdisciplinary Ontology Meeting, February 28th-March 1st, 2009, Tokyo), volume 2, feb 2009. [ bib ]
[25]
Mitsuhiro Okada. Some remarks on linear logic. In Mark van Atten, Pascal Boldini, Michel Bourdeau, and Gerhard Heinzmann, editors, One Hundred Years of Intuitionism (1907--2007): The Cerisy Conference, Publications of the Henri Poincaré Archives, pages 280--300. Birkhäuser, 2008. [ bib ]
[26]
Koji Mineshima, Mitsuhiro Okada, Yuri Sato, and Ryo Takemura. Diagrammatic reasoning system with Euler circles: Theory and experiment design. In Gem Stapleton, John Howse, and John Lee, editors, Proceedings of Diagrammatic Representation and Inference, 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008., volume 5223 of Lecture Notes in Computer Science, pages 188--205. Springer, 2008. [ bib ]
[27]
Mitsuhiro Okada and Ichiro Satoh, editors. 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, volume 4435. Springer, 2008. [ bib ]
[28]
Mitsuhiro Okada. Mapping-theory and contextual-theory of meaning: Husserl and wittgenstein. In Interdisciplinary Logic [29]. [ bib ]
[29]
Mitsuhiro Okada, editor. Interdisciplinary Logic, volume 1. Keio University Press, mar 2008. [ bib ]
[30]
Mitsuhiro Okada. Some remarks on difference between gentzen's finitist and heyting's intuitionist approaches toward intuitionistic logic and arithmetic. Annals of the Japan Association for Philosophy of Science, 16:1--18, mar 2008. [ bib ]
[31]
Mitsuhiro Okada, Ryo Takemura, and Juko Ando, editors. Reports on Interdisciplinary Logical Reasoning Studies. Keio University Press, Tokyo, mar 2008. [ bib ]
[32]
Yuri Sato, Ryo Takemura, Koji Mineshima, Chizuru Shikishima, Yutaro Sugimoto, Juko Ando, and Mitsuhiro Okada. Some remarks on deductive syllogistic reasoning studies; towards an integrated methodology of logical and psychological approaches. In Okada et al. [31], pages 3--32. [ bib ]
[33]
Mitsuhiro Okada, Barry Smith, and Yutaro Sugimoto. Remarks on logic for process descriptions in ontological reasoning: A drug interaction ontology (dio) case study. In Okada and Smith [34], pages 127--138. [ bib ]
[34]
Mitsuhiro Okada and Barry Smith, editors. Interdisciplinary Ontology (Proceedings of the First Interdisciplinary Ontology Meeting, February 26th-27th, 2008, Tokyo), Tokyo, feb 2008. Keio University Open Research Centre for Logic and Ontology, Keio University Press. [ bib ]
[35]
岡田 光弘. フッサール、ゲーデルから線形論理へ. 現代思想, 35(3):149--163, feb 2007. [ bib ]
[36]
長谷部 浩二 and 岡田 光弘. BAN論理からprotocol composition logicへ:セキュリティプロトコルの論理的検証法. 応用数理, 17(4):311--322, 12 2007. [ bib ]
[37]
Gergei Bana, Koji Hasebe, and Mitsuhiro Okada. Computational semantics for basic protocol logic -- a stochastic approach. In Iliano Cervesato, editor, Advances in Computer Science -- ASIAN 2007. Computer and Network Security 12th Asian Computing Science Conference, Doha, Qatar, December 9-11, 2007. Proceedings, volume 4846 of Lecture Notes in Computer Science, pages 86--94. Springer, dec 2007. [ bib ]
[38]
Mitsuhiro Okada and Ryo Takemura. Remarks on semantic completeness for proof-terms with laird's dual affine/intuitionistic λ-calculus. In Hubert Comon-Lundh, Claude Kirchner, and Hélène Kirchner, editors, Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, volume 4600 of Lecture Notes in Computer Science, pages 167--181. Springer, aug 2007. [ bib ]
[39]
Mitsuhiro Okada. On wittgenstein's remarks on recursive proofs: A preliminary report. [41], pages 121--131. [ bib ]
[40]
Mitsuhiro Okada and Ryo Takemura. A new proof-theoretical view on an old “dialogue logic”. In Okada [41], pages 153--167. [ bib ]
[41]
Mitsuhiro Okada, editor. Essays in the Foundations of Logical and Phenomenological Studies, volume 3 of Interdisciplinary Conference Series on Reasoning Studies. Keio University Press, mar 2007. [ bib ]
[42]
Hirohiko Kushida and Mitsuhiro Okada. A proof-theoretic study of the correspondence of hybrid logic and classical logic. Journal of Logic, Language and Information, 16(1):35--61, jan 2007. [ bib ]
[43]
Mitsuhiro Okada, Yutaro Sugimoto, Sumi Yoshikawa, and Akihiko Konagaya. Drug interaction ontology (DIO) and the resource-sensitive logical inferences. In Kokichi Futatsugi, Jean-Pierre Jouannaud, and José Meseguer, editors, Algebra, Meaning, and Computation: Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, volume 4060 of Lecture Notes in Computer Science, pages 616--642. Springer, jun 2006. [ bib ]
[44]
Koji Hasebe and Mitsuhiro Okada. Completeness and counter-example generations of a basic protocol logic (extended abstract). In Proceedings of the 6th International Workshop on Rule-Based Programming (RULE 2005), volume 147 of Electronic Notes in Theoretical Computer Science, pages 73--92. Elsevier, apr 2006. [ bib ]
[45]
Takeo Tsujii, Mitsuhiro Okada, and Shigeru Watanabe. Cognitive neuroscience for deductive reasoning and inhibitory mechanism: On the belief-bias effect. In Andler et al. [47]. [ bib ]
[46]
Juko Ando, Chizuru Shikishima, Kai Hiraishi, Yutaro Sugimoto, Ryo Takemura, and Mitsuhiro Okada. At the crossroads of logic, psychology, and behavioral genetics: Development of the deductive reasoning test in the keio twin-baroco project. In Andler et al. [47], pages 19--36. [ bib ]
[47]
Daniel Andler, Yoshinori Ogawa, Mitsuhiro Okada, and Shigeru Watanabe, editors. Reasoning and Cognition: Proceedings of the Interdisciplinary Conference on Reasoning and Cognition (Tokyo, Dec. 2005), volume 2, Tokyo, mar 2006. Keio University Press. [ bib ]
[48]
Mitsuhiro Okada. A linear logical view of intuitionistic logic. In Towards New Logic and Semantics: Franco-Japanese Collaborative Lectures on Philosophy of Logic [50], pages 185--229. [ bib ]
[49]
Mitsuhiro Okada. Hilbert school and husserl on the foundations of mathematics: Consistency problem and evidence theory. In Towards New Logic and Semantics: Franco-Japanese Collaborative Lectures on Philosophy of Logic [50], pages 127--184. [ bib ]
[50]
Mitsuhiro Okada, editor. Towards New Logic and Semantics: Franco-Japanese Collaborative Lectures on Philosophy of Logic. Keio University Press, Tokyo, mar 2006. [ bib ]
[51]
Max I. Kanovich, Mitsuhiro Okada, and Kazushige Terui. Intuitionistic phase semantics is almost classical. Mathematical Structures in Computer Science, 16(1):67--86, feb 2006. [ bib ]
[52]
岡田 光弘. ああ言えば幸福. In 巽 孝之, 坂上 貴之, 宮坂 敬造, 岡田 光弘, and 坂本 光, editors, 幸福の逆説. 慶應義塾大学出版会, 4 2005. [ bib ]
[53]
Chizuru Shikishima, Juko Ando, Pierre Grialou, Ryo Takemura, and Mitsuhiro Okada. A behavioural genetic study of syllogism solving using linguistic and graphical representations: A preliminary report. In Grialou et al. [55], pages 69--85. [ bib ]
[54]
Pierre Grialou and Mitsuhiro Okada. Questions on two cognitive models of deductive reasoning. In Grialou et al. [55], pages 31--67. [ bib ]
[55]
Pierre Grialou, Giuseppe Longo, and Mitsuhiro Okada, editors. Images and Reasoning: Proceedings of the Interdisciplinary Conference on Images, Reason and Reasoning (Paris, Mar. 2004), volume 1. The Ecole Normale Supérieure of Paris and Keio University of Tokyo, Keio University Press, mar 2005. [ bib ]
[56]
Koji Hasebe and Mitsuhiro Okada. Honesty inferences for proving correctness of security protocols. In Workshop on New Approaches to Software Construction (WNASC 2004), pages 45--57, Tokyo, sep 2004. [ bib ]
[57]
Koji Hasebe and Mitsuhiro Okada. Non-monotonic properties for proving correctness in a framework of compositional logic. In Andrei Sabelfeld, editor, Workshop on Foundations of Computer Security (FCS'04), number 31 in TUCS General Publication, pages 97--113, Tukuru, Finland, jun 2004. [ bib ]
[58]
Koji Hasebe and Mitsuhiro Okada. Inferences on honesty in compositional logic for protocol analysis. In Kokichi Futatsugi, Fumio Mizoguchi, and Naoki Yonezaki, editors, Software Security - Theories and Systems, Second Mext-NSF-JSPS International Symposium, ISSS 2003, Tokyo, Japan, November 4-6, 2003. Revised Papers, volume 3233 of Lecture Notes in Computer Science, pages 65--86. Springer, jun 2004. [ bib ]
[59]
Mitsuhiro Okada. Correspondence-theory and contextual-theory of meaning in husserl and wittgenstein. In Jocelyn Benoist and Sandra Laugier, editors, Husserl et Wittgenstein: de la description de l'expérience à la phénoménologie linguistique, pages 27--69. Georg Olms Verlag, 2004. [ bib ]
[60]
Mitsuhiro Okada. Linear logic and intuitionistic logic. La revie internationale de philosophe, (230):449--481, 2004. [ bib ]
[61]
岡田 光弘. 歪んだ真珠(バロック) --音楽における規則性vs反規則性、または ロゴスvsパトス--. 藝文研究, 9, 2003. [ bib ]
[62]
岡田 光弘. 矛盾は矛盾か. 科学哲学, 36(2):79--102, dec 2003. [ bib ]
[63]
Koji Hasebe, Jean-Pierre Jouannaud, Antonie Kremer, Mitsuhiro Okada, and Roland Zumkeller. Formal verification of dynamic real-time state-transition systems using linear logic. In 日本ソフトウェア科学会第20回全国大会予稿集, page 5, sep 2003. [ bib ]
[64]
Hirohiko Kushida and Mitsuhiro Okada. A proof-theoretic study of the correspondence of classical logic and modal logic. Journal of Symbolic Logic, 68(4):1403--1414, 2003. [ bib ]
[65]
Koji Hasebe, V. Cremet, Jean-Pierre Jouannaud, Antonie Kremer, and Mitsuhiro Okada. FATALIS: Real time processes as linear logic specifications. In International Workshop on Automated Verification of Infinite-State Systems, page 12, Warsaw, Poland, apr 2003. [ bib ]
[66]
Jean-Yves Girard, Mitsuhiro Okada, and Andre Scedrov. Preface. Theoretical Computer Science, 294(3):333, feb 2003. [ bib ]
[67]
Max I. Kanovich, Mitsuhiro Okada, and Andre Scedrov. Phase semantics for light linear logic. Theoretical Computer Science, 294(3):525--549, feb 2003. [ bib ]
[68]
Misao Nagayama and Mitsuhiro Okada. A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Theoretical Computer Science, 294(3):551--573, feb 2003. [ bib ]
[69]
Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, and Akinori Yonezawa, editors. Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002 Tokyo, Japan, November 8--10, 2002 Revised Papers, volume 2609. Springer, feb 2003. [ bib ]
[70]
Koji Hasebe and Mitsuhiro Okada. A logical verification method for security protocols based on linear logic and BAN logic. In Okada et al. [69], pages 357--367. [ bib ]
[71]
溝口 理一郎 and 岡田 光弘. レクチャーシリーズ「哲学とAIにおける対象世界モデリング」の企画にあたって. 人工知能学会誌, 17(2):222--223, mar 2002. [ bib ]
[72]
岡田 光弘. オントロジーの哲学的・論理学的背景. 人工知能学会誌, 17(2):224--231, mar 2002. [ bib ]
[73]
岡田 光弘. フッサールのフォーマルオントロジーとその影響. 人工知能学会誌, 17(3):335--344, may 2002. [ bib ]
[74]
岡田 光弘 and 長谷部 浩二. 線形論理に基づいたセキュリティ・プロトコルの論理的検証法. 電子情報通信学会「人工知能と知識処理」技術研究報告, 102(91):49--54, may 2002. [ bib ]
[75]
岡田 光弘. 現代のフォーマルオントロジーの動向とオントロジー工学. 人工知能学会誌, 17(4):434--442, jul 2002. [ bib ]
[76]
岡田 光弘. オントロジー応用のための方法論の考察と展望. 人工知能学会誌, 17(5):604--613, sep 2002. [ bib ]
[77]
Mitsuhiro Okada. A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science, 281(1-2):471--498, jun 2002. [ bib ]
[78]
Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive-data-type systems. Theoretical Computer Science, 272(1--2):41--68, feb 2002. [ bib ]
[79]
Mariangiola Dezani-Ciancaglini, Mitsuhiro Okada, and Masako Takahashi. Preface. Theoretical Computer Science, 272(1--2):1--2, feb 2002. [ bib ]
[80]
Mitsuhiro Okada. Ideal concepts, intuitions, and mathematical knowledge acquisitions in husserl and hilbert (a preliminary report). In Setsuo Arikawa and Ayumi Shinohara, editors, Progress in Discovery Science, Final Report of the Japanese Discovery Science Project, volume 2281 of Lecture Notes in Computer Science, pages 40--77, jan 2002. [ bib ]
[81]
Misao Nagayama and Mitsuhiro Okada. A new correctness criterion for the proof nets of non-commutative multiplicative linear logics. Journal of Symbolic Logic, 66(4):1524--1542, dec 2001. [ bib ]
[82]
岡田 光弘. 法律知識の論理による表現. In 吉野一, editor, 法律人工知能, pages 169--181. 創成社出版, feb 2000. [ bib ]
[83]
岡田 光弘. <書評>ウィトゲンシュタイン : 言語の限界 飯田隆著,講談社 1997年. 哲學, 104:77--83, dec 1999. [ bib ]
[84]
Mitsuhiro Okada. Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic. Theoretical Computer Science, 227(1--2):333--396, sep 1999. [ bib ]
[85]
Mitsuhiro Okada and Kazushige Terui. The finite model property for various fragments of intuitionistic linear logic. Journal of Symbolic Logic, 64(2):790--802, jun 1999. [ bib ]
[86]
Mitsuhiro Okada and Philip J. Scott. A note on rewriting theory for uniqueness of iteration. Theory and Applications of Categories, 6(4):47--64, 1999. [ bib ]
[87]
Frédéric Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. The calculus of algebraic constructions. In Paliath Narendran and Michaël Rusinowitch, editors, Rewriting Techniques and Applications, 10th International Conference, RTA-99 Trento, Italy, July 2--4, 1999 Proceedings, volume 1631 of Lecture Notes in Computer Science, pages 301--316, 1999. [ bib ]
[88]
須藤 路子, 岡田 光弘, and 西山 佑司. 日本語の文末表現における意味解釈と音響特性. 順天堂大学スポーツ健康科学研究, 2:12--16, mar 1998. [ bib ]
[89]
Mitsuhiro Okada. An introduction to linear logic: Phase semantics and expressiveness. In Takahashi et al. [90], pages 255--295. [ bib ]
[90]
Masako Takahashi, Mitsuhiro Okada, and Mariangiola Dezani-Ciancaglini, editors. Theories of types and proofs, volume 2 of Memoirs of Mathematical Society of Japan. Mathematical Society of Japan, 1998. [ bib ]
[91]
Mitsuhiro Okada and Kazushige Terui. Completeness proofs for linear logic based on the proof search method (preliminary report). In J. Garrigue, editor, RIMS Koukyuroku 1023: Type theory and its applications to computer systems, pages 57--75. Research Institute for Mathematical Sciences, Kyoto University, 1998. [ bib ]
[92]
Max I. Kanovich, Mitsuhiro Okada, and Andre Scedrov. Specifying real-time finite-state systems in linear logic (extended abstract). In COTIC '98, Second workshop on concurrent constraint programming for time critical applications and multi-agent systems (Satellite Workshop of CONCUR '98), volume 16 of Electronic Notes in Theoretical Computer Science, pages 42--59, 1998. [ bib ]
[93]
Masahiro Hamano and Mitsuhiro Okada. A direct independence proof of buchholz's hydra game on finite labeled trees. Archive for Mathematical Logic, 37(2):67--89, mar 1998. [ bib ]
[94]
岡田 光弘. フッサールの形式論理学分析における「多様体」概念の役割. 哲學, 101:1--43, mar 1997. [ bib ]
[95]
Max I. Kanovich, Mitsuhiro Okada, and Andre Scedrov. Phase semantics for light linear logic (extended abstract). In S. Brookes and M. Mislove, editors, MFPS XIII, Mathematical Foundations of Progamming Semantics, Thirteenth Annual Conference, volume 6 of Electronic Notes in Theoretical Computer Science, pages 221--234, apr 1997. [ bib ]
[96]
Masahiro Hamano and Mitsuhiro Okada. A hierarchy of the fragments of the system of inductive definition : Preliminary report. In Toshiyasu Arai, editor, RIMS Koukyuroku 976: Proceedings of the Symposium on Proof Theory and Ordinals, pages 169--181. Research Institute for Mathematical Sciences, Kyoto University, feb 1997. [ bib ]
[97]
Mitsuhiro Okada and Kazushige Terui. Semantic characterizations for reachability and trace equivalence in a linear logic-based process calculus : Preliminary report. In Toshiyasu Arai, editor, RIMS Koukyuroku 976: Proceedings of the Symposium on Proof Theory and Ordinals, pages 146--168. Research Institute for Mathematical Sciences, Kyoto University, feb 1997. [ bib ]
[98]
Misao Nagayama and Mitsuhiro Okada. Characterization theorems for multiplicative fragment of intuitionistic non-commutative linear logic : Preliminary report. In Toshiyasu Arai, editor, RIMS Koukyuroku 976: Proceedings of the Symposium on Proof Theory and Ordinals, pages 55--69. Research Institute for Mathematical Sciences, Kyoto University, feb 1997. [ bib ]
[99]
Jean-Pierre Jouannaud and Mitsuhiro Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349--391, feb 1997. [ bib ]
[100]
Masahiro Hamano and Mitsuhiro Okada. A relationship among gentzen's proof-reduction, kirby-paris' hydra game and buchholz's hydra game. Mathematical Logic Quarterly, 43(1):103--120, feb 1997. [ bib ]
[101]
岡田 光弘. デカルトにおける「論証」の概念と彼の形而上学的論証の論理的基準. 哲學, 100:63--86, mar 1996. [ bib ]
[102]
岡田 光弘. 線形論理に基づく並行計算モデル:並行計算の論理的理解の試み. 情報処理, 37(4):327--332, apr 1996. [ bib ]
[103]
岡田 光弘. 線形論理に基づく計算モデルの理論概説. 電子情報通信学会ソサイエティ大会講演論文集, 1996:571--572, sep 1996. [ bib ]
[104]
Jean-Yves Girard, Mitsuhiro Okada, and Andre Scedrov, editors. Linear Logic 96 Tokyo Meeting, Mita Campus, Keio University, Tokyo, Japan 29 March-02 April 1996, volume 3, 1996. [ bib ]
[105]
Misao Nagayama and Mitsuhiro Okada. A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. In Girard et al. [104], page 153. [ bib ]
[106]
Jean-Yves Girard, Mitsuhiro Okada, and Andre Scedrov. Preface. [104], page 1. [ bib ]
[107]
Mitsuhiro Okada. Phase semantics for higher order completeness, cut-elimination and normalization proofs. In Girard et al. [104], page 154. [ bib ]
[108]
須藤 路子, 岡田 光弘, 西山 佑司, and 桐谷 滋. 諸状況における終助詞「か」の意味解釈と音響特性. 日本音響学会研究発表会講演論文集, 2:323--324, sep 1995. [ bib ]
[109]
Misao Nagayama and Mitsuhiro Okada. A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic(preliminary report)(non-classical logics and their kripke semantics). In RIMS Kokyuroku 927: Proceedings of Symposium on Kripke Models and Non-Standard Logic, pages 66--87. Research Institute for Mathematical Sciences, Kyoto University, nov 1995. [ bib ]
[110]
Masahiro Hamano and Mitsuhiro Okada. A relationship among gentzen's proof-reduction, kirby-paris' hydra game, and buchholz's hydra game(preliminary report)(mathematical incompleteness in arithmetic). In RIMS Kokyuroku 912, pages 64--81. Research Institute for Mathematical Sciences, Kyoto University, may 1995. [ bib ]
[111]
Mitsuhiro Okada. A note on the strong normalizability of the self-referential logic. Philosophy, 95:1--14, 1994. [ bib ]
[112]
岡田 光弘. Girardの線形論理とその応用. Jsss tutorial lectures notes シリーズ, 日本ソフトウェア科学会, 1993. [ bib ]
[113]
Yexuan Gui and Mitsuhiro Okada. LAMBDALG: Higher order algebraic specification language. In Claude Kirchner, editor, Rewriting Techniques and Applications, 5th International Conference, RTA-93 Montreal, Canada, June 16--18, 1993 Proceedings, volume 690 of Lecture Notes in Computer Science, pages 462--466. Springer, jun 1993. [ bib ]
[114]
Yexuan Gui and Mitsuhiro Okada. System description of LAMBDALG - a higher order algebraic specification language. In Andrei Voronkov, editor, Logic Programming and Automated Reasoning, 4th International Conference, LPAR'93 St. Petersburg, Russia, July 13--20, 1993 Proceedings, volume 698 of Lecture Notes in Computer Science, pages 354--356. Springer, jun 1993. [ bib ]
[115]
Mitsuhiro Okada and Philip J. Scott. Rewriting theory for the uniqueness condition of higher types. In Proceedings of the Montreal Workshop on Programming Language Theory, Logic and Formal Methods Series 2, pages 20--28. Concordia University Press, jan 1992. [ bib ]
[116]
Jean-Pierre Jouannaud and Mitsuhiro Okada. A computation model for executable higher-order algebraic specification languages. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), pages 350--361. IEEE Press, jul 1991. [ bib ]
[117]
Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Javier Leach Albert, Burkhard Monien, and Mario Rodríguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium Madrid, Spain, July 8--12, 1991 Proceedings, volume 510 of Lecture Notes in Computer Science, pages 455--468. Springer, jun 1991. [ bib ]
[118]
Stéphane Kaplan and Mitsuhiro Okada, editors. Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings, volume 516. Springer, 1991. [ bib ]
[119]
岡田 光弘. 普遍記号学の夢と現実. 哲学, 91:143--161, dec 1990. [ bib ]
[120]
Nachum Dershowitz and Mitsuhiro Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75(1--2):111--138, 1990. [ bib ]
[121]
Mitsuhiro Okada and Adam Steele. Ordering structures and the knuth-bendix completion algorithm. In Proc. 29th Allerton Conference on Communication, Control and Computing, Allerton, IL. University of Illinois Press, oct 1989. [ bib ]
[122]
Pankaj Goyal, Mitsuhiro Okada, Yan-Zhen Qu, and Fereidoon Sadri. Temporal object-oriented databases. In Proceedings of Advanced Database Systems Symposium '89, Kyoto, December 1989, aug 1989. [ bib ]
[123]
Mitsuhiro Okada. Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system. In G. H. Gonnet, editor, ISSAC '89: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, pages 357--363, New York, NY, USA, 1989. ACM. [ bib ]
[124]
Mitsuhiro Okada. Weak logical constants and second order definability of the full-strength logical constants. Annals of the Japan Association for Philosophy of Science, 7(4):163--172, mar 1989. [ bib ]
[125]
Nachum Dershowitz and Mitsuhiro Okada. Conditional equational programming and the theory of conditional term rewriting. In Fifth Generation Computer Systems 1988, Proceedings of the International Conference on Fifth Generation Computer Systems 1988, Tokyo, Japan, November 28-December 2, pages 337--346. OHMSHA Ltd. Tokyo and Springer-Verlag, dec 1988. [ bib ]
[126]
Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In Stéphane Kaplan and Jean-Pierre Jouannaud, editors, Conditional Term Rewriting Systems, 1st International Workshop Orsay, France, July 8--10, 1987 Proceedings, volume 308 of Lecture Notes in Computer Science, pages 31--44. Springer, aug 1988. [ bib ]
[127]
Mitsuhiro Okada. A logical analysis on theory of conditional rewriting (preliminary report). In Stéphane Kaplan and Jean-Pierre Jouannaud, editors, Conditional Term Rewriting Systems, 1st International Workshop, Orsay, France, July 8-10, 1987, Proceedings, volume 308 of Lecture Notes in Computer Science, pages 179--196. Springer, aug 1988. [ bib ]
[128]
Nachum Dershowitz and Mitsuhiro Okada. Proof-theoretic techniques for term rewriting theory. In Proceedings of the Third Annual Symposium on Logic in Computer Science, pages 104--111. IEEE Computer Society, jul 1988. [ bib ]
[129]
Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar. Canonical conditional rewrite systems. In Ewing L. Lusk and Ross A. Overbeek, editors, 9th International Conference on Automated Deduction Argonne, Illinois, USA, May 23--26, 1988 Proceedings, volume 310 of Lecture Notes in Computer Science, pages 538--549. Springer, jul 1988. [ bib ]
[130]
Mitsuhiro Okada. Prolog with modality. In Proc. European Workshop on Logical Methods in AI, Roscoff, France, 1988. [ bib ]
[131]
Mitsuhiro Okada. Note on a proof of the extended kirby-paris theorem on labeled finite trees. European Journal of Combinatorics, 9(3):249--253, may 1988. [ bib ]
[132]
Mitsuhiro Okada. On a theory of weak implications. Journal of Symbolic Logic, 53(1):200--211, mar 1988. [ bib ]
[133]
岡田 光弘. フッサール初期の「哲学的---数学的諸研究の終結テーマ」とゲッチンゲン学派の論理哲学. 哲学, 37:210--221, may 1987. [ bib ]
[134]
岡田 光弘. 論理記号導入規則による論理的意味論について. 科学基礎論研究, 68(2):65--71, jun 1987. [ bib ]
[135]
Mitsuhiro Okada. A weak intuitionistic propositional logic with purely constructive implication. Studia Logica, 46(4):371--382, dec 1987. [ bib ]
[136]
Mitsuhiro Okada. A simple relationship between buchholz's new system of ordinal notations and takeuti's system of ordinal diagrams. Journal of Symbolic Logic, 52(3):577--581, sep 1987. [ bib ]
[137]
Mitsuhiro Okada. Finite combinatorics. Combinatorics, American Mathematical Scoiety, aug 1987. [ bib ]
[138]
Mitsuhiro Okada and Gaisi Takeuti. On the theory of quasi-ordinal diagram. In Stephen G. Simpson, editor, Logic and Combinatorics (Proceedings of a Summer Research Conference held August 4-10, 1985), volume 65 of Contemporary Mathematics, pages 295--308. American Mathematical Society, 1987. [ bib ]
[139]
岡田 光弘. 形式的意味論と整合性証明. 哲学, pages 61--86, nov 1986. [ bib ]

This file was generated by bibtex2html 1.98.

Last Update: 2015-06-22