12,080
edits
Changes
Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 18:52, 15 May 2013
, 18:52, 15 May 2013→6.43. Reflective Extensions: markup
The dyadic components of sign relations can be given graph-theoretic representations, namely, as ''digraphs'' (directed graphs), that provide concise pictures of their structural and potential dynamic properties. By way of terminology, a directed edge <math>(x, y)\!</math> is called an ''arc'' from point <math>x\!</math> to point <math>y,\!</math> and a self-loop <math>(x, x)\!</math> is called a ''sling'' at <math>x.\!</math>
The dyadic components of sign relations can be given graph-theoretic representations, namely, as ''digraphs'' (directed graphs), that provide concise pictures of their structural and potential dynamic properties. By way of terminology, a directed edge <math>(x, y)\!</math> is called an ''arc'' from point <math>x\!</math> to point <math>y,\!</math> and a self-loop <math>(x, x)\!</math> is called a ''sling'' at <math>x.\!</math>
The denotative components <math>\operatorname{Den}^1 (L_\text{A})\!</math> and <math>\operatorname{Den}^1 (L_\text{B})\!</math> can be viewed as digraphs on the 10 points of the world set <math>W.\!</math> The arcs of these digraphs are given as follows.
<pre>
<pre>
1. Den1 (A) has an arc from each point of [A]A = {<A>, <i>} to A and from each point of [B]A = {<B>, <u>} to B.
1. Den1 (A) has an arc from each point of [A]A = {<A>, <i>} to A and from each point of [B]A = {<B>, <u>} to B.