<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Observing the Truth: Diagrams, Sets and Free Rides</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Gem Stapleton</string-name>
          <email>g.e.stapleton@brighton.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Brighton</institution>
          ,
          <addr-line>Brighton</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>syntax choices1.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>statements, such as a set of (perhaps a single) Euler diagrams. Such a translation
essentially chooses a representation, at the abstract syntax level, of the originally
de ned statements in the other notation. Here, this idea is generalized to the
notion of an observational advantage that does not require the existence of a
translation between notations. Instead, all that is required is for the two sets of
statements to be semantically equivalent.</p>
      <p>To illustrate, suppose we have the two set-theory statements P = Q and
P \ R = ;. The two Euler diagrams d1 and d2 in gure 2 are, between them,
semantically equivalent to P = Q and P \ R = ;:</p>
      <p>D = fd1; d2g</p>
      <p>S = fP = Q; Q \ R = ;g:
We can observe P \ R = ; from S because it is written explicitly in S. However,
we cannot observe P \ R = ; from either d1 and d2. In this case, from D we must
infer d, which directly expresses P \ R = ;. Therefore, S has an observational
advantage over D. Moreover, D also has an observational advantage over S, since
we can observe Q \ R = ; from D but not S.</p>
      <p>
        Through de ning what it means to be able to observe one statement from a
set of statements, we can precisely describe the observational advantages of one
set of statements over another. In particular, in the case of Euler diagrams and
set theory we can prove that Euler diagrams are observationally complete. That is
given a nite set of set-theory statements, S, there exists a single Euler diagram,
d, that is semantically equivalent to S such that any set-theory statement that
can be inferred from S can be observed from d [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]2. Thus, it is possible to
characterise, formally, the observational advantages of Euler diagrams over
settheory. Importantly, the theory of observational advantages allows us to explain
why diagrams are advantageous representations of sets in a more general way
than free rides.
      </p>
      <p>
        Acknowledgement This extended abstract is based on research conducted
collaboratively with Mateja Jamnik and Atsushi Shimojima [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ].
2 We note that d must explicitly represent all sets occurring in S and that the inferred
set-theory statements must only represent sets occurring in S; we refer the reader
to [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ] for more details.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Blake</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stapleton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rodgers</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Howse</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The impact of topological and graphical choices on the perception of Euler diagrams</article-title>
          .
          <source>Information Sciences</source>
          <volume>330</volume>
          ,
          <volume>455</volume>
          {
          <fpage>482</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Rodgers</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Purchase</surname>
          </string-name>
          , H.:
          <article-title>Wellformedness properties in Euler diagrams: Which should be used</article-title>
          ?
          <source>IEEE Transactions on Visualization and Computer Graphics</source>
          <volume>18</volume>
          (
          <issue>7</issue>
          ),
          <volume>1089</volume>
          {
          <fpage>1100</fpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Rodgers</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stapleton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Visualizing sets with linear diagrams</article-title>
          .
          <source>ACM Transactions on Computer-Human Interaction</source>
          <volume>22</volume>
          ,
          <issue>27</issue>
          :1{
          <fpage>27</fpage>
          :
          <fpage>39</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Shimojima</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Semantic Properties of Diagrams and Their Cognitive Potentials</article-title>
          .
          <source>CSLI Publications</source>
          , Stanford, CA (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Stapleton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jamnik</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shimojima</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>What makes an e ective representation of information: A formal account of inferential advantages</article-title>
          .
          <source>Journal of Logic</source>
          ,
          <article-title>Language and Information (under review)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Stapleton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jamnik</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shimojima</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>E ective representation of information: Generalizing free rides</article-title>
          .
          <source>In: Diagrams 2016</source>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>