12,080
edits
Changes
Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 15:45, 16 November 2012
, 15:45, 16 November 2012→6.31. Relations in General: markup
| <math>L_{M \,\text{at}\, j} = \{ (x_1, \ldots, x_j, \ldots, x_k) \in L : x_j \in M \}.\!</math>
| <math>L_{M \,\text{at}\, j} = \{ (x_1, \ldots, x_j, \ldots, x_k) \in L : x_j \in M \}.\!</math>
|}
|}
Returning to dyadic relations, it is useful to describe some familiar classes of objects in terms of their local and numerical incidence properties. Let <math>L \subseteq S \times T\!</math> be an arbitrary dyadic relation. The following properties of <math>L\!</math> can then be defined.
<pre>
<pre>
R is total at S iff R is ³1 regular at S.
R is total at S iff R is ³1 regular at S.
R is total at T iff R is ³1 regular at T.
R is total at T iff R is ³1 regular at T.