Skip to main content
Article thumbnail
Location of Repository

Corresponding regions in Euler diagrams

By John Howse, Gem Stapleton, Jean Flower and John Taylor


Euler diagrams use topological properties to represent set-theoretical concepts and thus are `intuitive' to some people. When reasoning with Euler diagrams, it is essential to have a notion of correspondence among the regions in different diagrams. At the semantic level, two regions correspond when they represent the same set. However, we wish to construct a purely syntactic definition of corresponding regions, so that reasoning can take place entirely at the diagrammatic level. This task is interesting in Euler diagrams because some regions of one diagram may be missing from another. We construct the correspondence relation from `zones' or minimal regions, introducing the concept of `zonal regions' for the case in which labels may differ between diagrams. We show that the relation is an equivalence relation and that it is a generalization of the counterpart relations introduced by Shin and Hammer

Topics: G000 Computing and Mathematical Sciences
Publisher: Springer-Verlag
Year: 2002
DOI identifier: 10.1007/3-540-46037-3_7
OAI identifier:

Suggested articles


  1. (1933). Collected Papers, doi
  2. Comparing regions in spider diagrams. Available at
  3. (2002). Constraint trees. doi
  4. (1998). Euler’s visual logic. doi
  5. Lettres a une princesse d’allemagne, doi
  6. (1995). Logic and Visual Information. doi
  7. (2000). On the completness and expressiveness of spider diagram systems. doi
  8. On the diagrammatic and mechanical representation of propositions and reasonings. doi
  9. (1998). On visual formalisms. In doi
  10. (2001). Reasoning with extended Venn-Peirce diagrammatic systems.
  11. specification, version 1.3. Available from
  12. (1994). The Logical Status of Diagrams. doi
  13. (2001). Towards a formalization of constraint diagrams. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.