1. Please note on-going interdisciplinary conferences at The Theory And Application On Diagrams: An International Conference Series.

2. It is an interesting question why this has been the case. The possibility of being misled by diagrams and their limited expressive power have been considered as major reasons for their rejection. Mark Greaves (2002) explores the philosophical and historical roots for the adoption or rejection of diagrams in logical and geometric proofs, and concludes that whether a diagrammatic system is invented, or accepted, is a reflection of whether the inventor, or user, accepts a certain metaphysics.

3. Note that, however natural this convention may sound, this is still an arbitrary convention. For example, Lambert and Englebretsen’s systems visualize individuals as points and sets as lines (Lambert 1764; Englebretsen 1992).

4. For more details, see Hammer and Shin (1998).

5. The name of the program is CDEG (Computerized Diagrammatic Elementary Geometry). See Miller 2007. As the lines and circles of FG diagrams do not have the metric properties of Euclidean lines and circles, the ranges of mathematical possibilities FG diagrams realize do not line up with ranges of possible configurations in Euclidean geometry. There are, in particular, FG diagrams whose topological relationships cannot be realized by a Euclidean configuration. Determining whether an FG diagram has this property is a decidable, though NP-hard, problem. See Miller 2006.

6. The part of the derivation involving positional rules starts with the sub-diagram depicting the initial configuration of I,16. There are then five postional rules used to devive the diagram depicting the containment of ACF withing ACD. They are:

1. Input: diagram D. Output: sub-diagram of D.
2. Input: diagram D satisfying the conditions of a previously proven construction. Output: diagram resulting from application of construction to D.
3. Input: diagram D of a segment S with a point X on it and point Y on a side of it. Output: diagram resulting from joining X and Y in D.
4. Input: diagram D of a an angle with vertex X and point Y inside of it. Output: diagram resulting from joining X and Y in D.
5. Input: diagram D and diagrams \(D_1,\ldots,D_n\) composed of a sub-diagram of D and a point X not in D. Output: diagram D with point X added in the only position in D compatible with \(D_1,\ldots,D_n\) (if there is only one position for A in D compatible with \(D_1,\ldots,D_n\)).

With (i), (ii) and (v), the sub-diagram with E added to the sub-diagram depicting the initial configuration is derived. Call this sub-diagram G. From G with (i), (ii), (iii) and (v), the sub-diagram \(G') depicting the segment AC and the point F is derived. From G with (i), (ii), (iii) and (v) again, the sub-diagram \(G''\) depicting the segment CD and the point F is derived. (v) is then applied to the sub-diagram depicting the angle ACD, the sub-diagram \(G'\) and the sub-diagram \(G''\) to derive the sub-diagram \(G'''\) depicting the angle ACD and F. Finally, (iv) is applied to \(G'''\) to derive the sub-diagram depicting the containment of ACF in ACD.

If one is interested solely in how information from diagrams is situated logically in Euclid’s proofs according to the Eu approach, diagrams need not be formalized as symbols. One can instead represent the geometric information extracted from diagrams in sentential form. This is what is done with the formal system E, presented in Avigad et al. 2009. The system is complete with respect to modern axiomatizations of elementary Euclidean geometry. Diagrammatic inference in the system is captured in the system via a notion of direct diagrammatic consequence. Deciding whether something is a direct diagrammatic consequence in E is a polynomial time problem.

7. For example: Reasoning with Diagrammatic Representations: 1992 AAAI Spring Symposium; Cognitive and Computational Models of Spatial Representation: 1996 AAAI Spring Symposium; Reasoning with Diagrammatic Representations II: 1997 AAAI Fall Symposium; and Formalizing Reasoning with Visual and Diagrammatic Representations: 1998 AAAI Fall Symposium. See also Narayanan (1993).

8. The following conferences are good evidence for this effort: VISUAL ’98: Visualization Issues in Formal Methods (Lisbon); International Roundtable Conference on Visual and Spatial Reasoning in Design (MIT, 1999); and Theories of Visual Languages—Track of VL ’99: 1999 IEEE Symposium on Visual Languages.

9. Such problems have been studied under the banner of “Topological Inference ” and are nearly all NP hard (Grigni et al. 1995; Lemon & Pratt 1997; Lemon 2001).

10. As a practical instance of Helly’s Theorem.

11. For further logical study on this issue, refer to papers by Aiello and van Benthem, Fisler, and Lemon, in Barker-Plummer et al. (2002).

12. See Aristotle On the Soul and On the Memory and Recollection.

13. Block 1981 is one of the best collections of important papers on this debate, and Block (1983) presents a succinct summary of this controversy and raises insightful philosophical questions about the debate. Chapters 1–4 of Tye 1991 are a good overview of both cognitive scientists’ and philosophers’ various positions on this issue.