Name
Abstract | ||
|---|---|---|
One of the traditional applications of Euler diagrams is as a representation or counterpart of the usual set-theoretical models of given sentences. However, Euler diagrams have recently been investigated as the counterparts of logical formulas, which constitute formal proofs. Euler diagrams are rigorously defined as syntactic objects, and their inference systems, which are equivalent to some symbolic logical systems, are formalized. Based on this observation, we investigate both counter-model construction and proof-construction in the framework of Euler diagrams. We introduce the notion of \"counter-diagrammatic proof\", which shows the invalidity of a given inference, and which is defined as a syntactic manipulation of diagrams of the same sort as inference rules to construct proofs. Thus, in our Euler diagrammatic framework, the completeness theorem can be formalized in terms of the existence of a diagrammatic proof or a counter-diagrammatic proof. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11225-014-9584-x | Studia Logica |
Keywords | Field | DocType |
Mathematical logic,Completeness,Euler diagrams | Venn diagram,Discrete mathematics,Gödel's completeness theorem,Algebra,Diagrammatic reasoning,Inference,Euler diagram,Algorithm,Euler's formula,Mathematical proof,Rule of inference,Mathematics | Journal |
Volume | Issue | ISSN |
103 | 4 | 0039-3215 |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ryo Takemura | 1 | 85 | 9.52 |