A proof-theoretical investigation on diagrammatic reasoning
Project/Area Number |
22820053
|
Research Category |
Grant-in-Aid for Research Activity Start-up
|
Allocation Type | Single-year Grants |
Research Field |
Philosophy/Ethics
|
Research Institution | Keio University |
Principal Investigator |
TAKEMURA Ryo 慶應義塾大学, 文学部, 講師 (70583665)
|
Project Period (FY) |
2010 – 2011
|
Project Status |
Completed (Fiscal Year 2011)
|
Budget Amount *help |
¥2,964,000 (Direct Cost: ¥2,280,000、Indirect Cost: ¥684,000)
Fiscal Year 2011: ¥1,443,000 (Direct Cost: ¥1,110,000、Indirect Cost: ¥333,000)
Fiscal Year 2010: ¥1,521,000 (Direct Cost: ¥1,170,000、Indirect Cost: ¥351,000)
|
Keywords | 論理学 / 証明論 / 図形推論 |
Research Abstract |
Recently, logical reasoning based on diagrammatic or graphical representations has been investigated by researchers from various areas. For the study of diagrammatic reasoning, it is important to combine methods and analyses of traditional symbolic logic and cognitive science. In such studies, researches so far have concentrated on semantic studies on the static nature of diagrams, i. e., the nature at the level of representation. And there are few proof-theoretical investigations on the dynamic nature of diagrams, i. e., the nature at the level of proofs or at the level of manipulation of diagrams. In this study, I introduced a proof-theoretical framework to investigate the dynamic nature of diagrammatic representations, in particular of Euler and Venn diagrams. Then, I formalized, by applying one of the basic proof-theoretical techniques of logic translation, the notion of "free ride" in my proof-theoretical framework. Free ride is one of the most basic properties of diagrams that is mainly discussed in the literature of cognitive science as an account of inferential efficacy of diagrams. Then, based on the formalization of free ride, I investigated a proof-theoretical characterization of the structure of Euler diagrammatic proofs and that of Venn diagrammatic proofs, compared with the usual natural deduction proofs of the traditional symbolic logic.
|
Report
(3 results)
Research Products
(25 results)