Order:
Disambiguations
Mitsuhiro Okada [16]M. Okada [8]Masato Okada [4]Michio Okada [2]
Masafumi Okada [1]Masaya Okada [1]Megumi Okada [1]Mitsu Okada [1]

Not all matches are shown. Search with initial or firstname to single out others.

See also
Profile: Mitsuhiro Okada (Keio University)
  1.  31
    A Diagrammatic Inference System with Euler Circles.Koji Mineshima, Mitsuhiro Okada & Ryo Takemura - 2012 - Journal of Logic, Language and Information 21 (3):365-391.
    Proof-theory has traditionally been developed based on linguistic (symbolic) representations of logical proofs. Recently, however, logical reasoning based on diagrammatic or graphical representations has been investigated by logicians. Euler diagrams were introduced in the eighteenth century. But it is quite recent (more precisely, in the 1990s) that logicians started to study them from a formal logical viewpoint. We propose a novel approach to the formalization of Euler diagrammatic reasoning, in which diagrams are defined not in terms of regions as in (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  2.  15
    The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
    Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its intuitionistic version (ILLC). (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  3.  28
    A Generalized Syllogistic Inference System Based on Inclusion and Exclusion Relations.Koji Mineshima, Mitsuhiro Okada & Ryo Takemura - 2012 - Studia Logica 100 (4):753-785.
    We introduce a simple inference system based on two primitive relations between terms, namely, inclusion and exclusion relations. We present a normalization theorem, and then provide a characterization of the structure of normal proofs. Based on this, inferences in a syllogistic fragment of natural language are reconstructed within our system. We also show that our system can be embedded into a fragment of propositional minimal logic.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  4.  3
    Categorical and Dimensional Perceptions in Decoding Emotional Facial Expressions.Tomomi Fujimura, Yoshi-Taka Matsuda, Kentaro Katahira, Masato Okada & Kazuo Okanoya - 2012 - Cognition and Emotion 26 (4):587-601.
  5. A Simple Relationship Between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams.Mitsuhiro Okada - 1987 - Journal of Symbolic Logic 52 (3):577-581.
  6. The Implicit Processing of Categorical and Dimensional Strategies: An fMRI Study of Facial Emotion Perception.Yoshi-Taka Matsuda, Tomomi Fujimura, Kentaro Katahira, Masato Okada, Kenichi Ueno, Kang Cheng & Kazuo Okanoya - 2013 - Frontiers in Human Neuroscience 7.
  7.  17
    A Proof-Theoretic Study of the Correspondence of Classical Logic and Modal Logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
    It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg [10] proved this fact in a syntactic way. Mints [7] extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints' result to the basic modal logic S4; we (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  8.  23
    Syntactic Reduction in Husserl’s Early Phenomenology of Arithmetic.Mirja Hartimo & Mitsuhiro Okada - 2016 - Synthese 193 (3):937-969.
    The paper traces the development and the role of syntactic reduction in Edmund Husserl’s early writings on mathematics and logic, especially on arithmetic. The notion has its origin in Hermann Hankel’s principle of permanence that Husserl set out to clarify. In Husserl’s early texts the emphasis of the reductions was meant to guarantee the consistency of the extended algorithm. Around the turn of the century Husserl uses the same idea in his conception of definiteness of what he calls “mathematical manifolds.” (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  6
    Linear Logic and Intuitionistic Logic.Mitsuhiro Okada - 2004 - Revue Internationale de Philosophie 4:449-481.
    Translate
      Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  10.  20
    Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants.Mitsuhiro Okada - 1989 - Annals of the Japan Association for Philosophy of Science 7 (4):163-172.
  11.  10
    A Direct Independence Proof of Buchholz's Hydra Game on Finite Labeled Trees.Masahiro Hamano & Mitsuhiro Okada - 1998 - Archive for Mathematical Logic 37 (2):67-89.
    We shall give a direct proof of the independence result of a Buchholz style-Hydra Game on labeled finite trees. We shall show that Takeuti-Arai's cut-elimination procedure of $(\Pi^{1}_{1}-CA) + BI$ and of the iterated inductive definition systems can be directly expressed by the reduction rules of Buchholz's Hydra Game. As a direct corollary the independence result of the Hydra Game follows.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12. Reconsideration of English Education Policy in Japan: How Language Planners Can Challenge English Imperialism.Megumi Okada - forthcoming - Sophia.
     
    Export citation  
     
    My bibliography  
  13.  11
    Wittgenstein et le lien entre la signification d'un énoncé mathématique et sa preuve.Mathieu Marion & Mitsuhiro Okada - 2012 - Philosophiques 39 (1):101-124.
    La thèse selon laquelle la signification d’un énoncé mathématique est donnée par sa preuve a été soutenue à la fois par Wittgenstein et par les intuitionnistes, à la suite de Heyting et de Dummett. Dans ce texte, nous nous attachons à clarifier le sens de cette thèse chez Wittgenstein, afin de montrer en quoi sa position se distingue de celle des intuitionnistes. Nous montrons par ailleurs que cette thèse prend sa source chez Wittgenstein dans sa réflexion, durant la période intermédiaire, (...)
    Translate
      Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  14.  14
    A Proof–Theoretic Study of the Correspondence of Hybrid Logic and Classical Logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
    In this paper, we show the equivalence between the provability of a proof system of basic hybrid logic and that of translated formulas of the classical predicate logic with equality and explicit substitution by a purely proof–theoretic method. Then we show the equivalence of two groups of proof systems of hybrid logic: the group of labelled deduction systems and the group of modal logic-based systems.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  12
    Music-Picture: One Form of Synthetic Art Education.Masashi Okada - 2003 - Journal of Aesthetic Education 37 (4):73-84.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  16.  15
    A Weak Intuitionistic Propositional Logic with Purely Constructive Implication.Mitsuhiro Okada - 1987 - Studia Logica 46 (4):371 - 382.
    We introduce subsystems WLJ and SI of the intuitionistic propositional logic LJ, by weakening the intuitionistic implication. These systems are justifiable by purely constructive semantics. Then the intuitionistic implication with full strength is definable in the second order versions of these systems. We give a relationship between SI and a weak modal system WM. In Appendix the Kripke-type model theory for WM is given.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  17.  8
    On a Theory of Weak Implications.Mitsuhiro Okada - 1988 - Journal of Symbolic Logic 53 (1):200-211.
  18.  3
    A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game.Masahiro Hamano & Mitsuhiro Okada - 1997 - Mathematical Logic Quarterly 43 (1):103-120.
    We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game . Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game , by a simple and natural interpretation . Jervell proposed another type of a combinatorial game, by abstracting (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  19.  7
    A New Correctness Criterion for the Proof Nets of Non-Commutative Multiplicative Linear Logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
    This paper presents a new correctness criterion for marked Danos-Reginer graphs (D-R graphs, for short) of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  20. At the Crossroads of Logic, Psychology, and Behavioral Genetics.J. Ando, C. Shikishima, K. Hiraishi, Y. Sugimoto, R. Takemura & M. Okada - 2006 - In D. Andler, M. Okada & I. Watanabe (eds.), Reasoning and Cognition. pp. 9-36.
     
    Export citation  
     
    My bibliography  
  21. Reasoning and Cognition.D. Andler, M. Okada & I. Watanabe (eds.) - 2006
    Translate
     
     
    Export citation  
     
    My bibliography  
  22. Novel Method to Classify Hemodynamic Response Obtained Using Multi-Channel fNIRS Measurements Into Two Groups: Exploring the Combinations of Channels.Hiroko Ichikawa, Jun Kitazono, Kenji Nagata, Akira Manda, Keiichi Shimamura, Ryoichi Sakuta, Masato Okada, Masami K. Yamaguchi, So Kanazawa & Ryusuke Kakigi - 2014 - Frontiers in Human Neuroscience 8.
  23. A Proof-Theoretic Study Of The Correspondence Of Classical Logic And Modal Logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
    It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg proved this fact in a syntactic way. Mints extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints’ result to the basic modal logic S4; we investigate the (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  24. Fieldworks for Investigating How Children Are Interacting with Sociable Trash Box.Taisuke Miyake, Yoto Yamaji, Naoki Ohshima, P. Ravindra S. De Silva & Michio Okada - 2013 - Transactions of the Japanese Society for Artificial Intelligence 28 (2):197-209.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25. A New Correctness Criterion For The Proof Nets Of Non-Commutative Multiplicative Linear Logics.Misao Nagayama & Mitsuhiro Okada - 2001 - Journal of Symbolic Logic 66 (4):1524-1542.
    This paper presents a new correctness criterion for marked Danos-Reginer graphs of Multiplicative Cyclic Linear Logic MCLL and Abrusci's non-commutative Linear Logic MNLL. As a corollary we obtain an affirmative answer to the open question whether a known quadratic-time algorithm for the correctness checking of proof nets for MCLL and MNLL can be improved to linear-time.
    Direct download  
     
    Export citation  
     
    My bibliography  
  26. Sociable Spotlight: The Impact of Interactive Artifacts to Ground the Social Interactions.Naoki Ohshima, Yuta Yamaguchi, P. Ravindra S. De Silva & Michio Okada - 2014 - Transactions of the Japanese Society for Artificial Intelligence 29 (3):288-300.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  27. Essays in the Foundations of Logical and Phenomenological Studies (Interdisciplinary Series on Reasoning Studies, Vol. 3).M. Okada (ed.) - 2007 - Keio University.
    No categories
     
    Export citation  
     
    My bibliography  
  28. Ontology and Phenomenology: Franco-Japanese Collaborative Lectures.M. Okada (ed.) - 2009 - Keio University.
    No categories
     
    Export citation  
     
    My bibliography  
  29. Proceedings of the First Interdisciplinary Ontology Meeting (InterOntology 2008).M. Okada & B. Smith (eds.) - 2008 - Keio University Press.
    No categories
     
    Export citation  
     
    My bibliography  
  30. Self-Organizing Symbol Acquisition and Motion Generation Based on Dynamics-Based Information Processing System.Masafumi Okada, Daisuke Nakamura & Yoshihiko Nakamura - 2005 - Transactions of the Japanese Society for Artificial Intelligence 20:177-187.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
    Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic and for affine logic, i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL, and intuitionistic LLW. In addition, we shall show the finite model property for contractive linear logic, i.e., linear logic with contraction, and for its intuitionistic version. The finite model property for related substructural logics also follow by our (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  32. Using Machine Learning to Develop a High-Performance Virtual Screening Method for Drug Design.Masato Okada, Katsutoshi Kanamori, Shin Aoki & Hayato Ohwada - 2014 - Transactions of the Japanese Society for Artificial Intelligence 29 (1):194-200.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33. Genetic Factors of Individual Differences in Decision Making in Economic Behavior: A Japanese Twin Study Using the Allais Problem.Chizuru Shikishima, Kai Hiraishi, Shinji Yamagata, Juko Ando & Mitsuhiro Okada - 2015 - Frontiers in Psychology 6.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. Detection of Driver's Anomaly Behavior Using Wireless 3D-Accelerometers.Masahiro Tada, Futoshi Naya, Masaya Okada, Haruo Noma, Tomoji Toriyama & Kiyoshi Kogure - 2008 - Transactions of the Japanese Society for Artificial Intelligence 23:105-116.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography