Changes

\end{array}</math></p>

\end{array}</math></p>

In this definition ''q''_''b'' = ''q''(''b''), for each ''b'' in '''B'''.  Thus, the proposition d''x''_''i'' is true of the path ''q'' = ‹''u'',&nbsp;''v''› exactly if the terms of ''q'', the endpoints ''u'' and ''v'', lie on different sides of the question ''x''_''i''.

In this definition <math>q_b = q(b),\!</math> for each <math>b\!</math> in <math>\mathbb{B}.</math> Thus, the proposition <math>\operatorname{d}x_i</math> is true of the path <math>q = (u, v)\!</math> exactly if the terms of <math>q,\!</math> the endpoints <math>u\!</math> and <math>v,\!</math> lie on different sides of the question <math>x_i.\!</math>

Now we can use the language of features in 〈d<font face="lucida calligraphy">X</font>〉, indeed the whole calculus of propositions in [d<font face="lucida calligraphy">X</font>], to classify paths and sets of paths.  In other words, the paths can be taken as models of the propositions ''g''&nbsp;:&nbsp;d''X''&nbsp;&rarr;&nbsp;'''B'''.  For example, the paths corresponding to ''Diag''(''X'') fall under the description <font face=system>(</font>d''x''₁<font face=system>)</font>&hellip;<font face=system>(</font>d''x''_''n''<font face=system>)</font>, which says that nothing changes among the set of features {''x''₁,&nbsp;&hellip;,&nbsp;''x''_''n''}.

Now we can use the language of features in 〈d<font face="lucida calligraphy">X</font>〉, indeed the whole calculus of propositions in [d<font face="lucida calligraphy">X</font>], to classify paths and sets of paths.  In other words, the paths can be taken as models of the propositions ''g''&nbsp;:&nbsp;d''X''&nbsp;&rarr;&nbsp;'''B'''.  For example, the paths corresponding to ''Diag''(''X'') fall under the description <font face=system>(</font>d''x''₁<font face=system>)</font>&hellip;<font face=system>(</font>d''x''_''n''<font face=system>)</font>, which says that nothing changes among the set of features {''x''₁,&nbsp;&hellip;,&nbsp;''x''_''n''}.