4 found
  1.  22
    Koji Mineshima, Mitsuhiro Okada & Ryo Takemura (2012). A Diagrammatic Inference System with Euler Circles. 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   2 citations  
  2.  2
    Yuri Sato & Koji Mineshima (forthcoming). How Diagrams Can Support Syllogistic Reasoning: An Experimental Study. Journal of Logic, Language and Information:1-47.
    This paper explores the question of what makes diagrammatic representations effective for human logical reasoning, focusing on how Euler diagrams support syllogistic reasoning. It is widely held that diagrammatic representations aid intuitive understanding of logical reasoning. In the psychological literature, however, it is still controversial whether and how Euler diagrams can aid untrained people to successfully conduct logical reasoning such as set-theoretic and syllogistic reasoning. To challenge the negative view, we build on the findings of modern diagrammatic logic and introduce (...)
    Direct download (2 more)  
    Export citation  
    My bibliography  
  3.  18
    Koji Mineshima, Mitsuhiro Okada & Ryo Takemura (2012). A Generalized Syllogistic Inference System Based on Inclusion and Exclusion Relations. 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  
  4. Koji Mineshima (2008). A Presuppositional Analysis of Definite Descriptions in Proof Theory. In Satoh (ed.), New Frontiers in Artificial Intelligence. Springer 214--227.
    Direct download  
    Export citation  
    My bibliography