Changes

Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)

Revision as of 22:06, 30 December 2012

6 bytes added , 22:06, 30 December 2012

→‎6.35. Reducibility of Sign Relations: markup

Line 8,775: Line 8,775:

===6.35. Reducibility of Sign Relations===

+

This Section introduces a topic of fundamental importance to the whole theory of sign relations, namely, the question of whether triadic relations are ''determined by'', ''reducible to'', or ''reconstructible from'' their dyadic projections.

<pre>

−

This section introduces a topic of fundamental importance to the whole theory of sign relations, namely, the question of whether triadic relations are "determined by", "reducible to", or "reconstructible from" their dyadic projections.

−

Suppose R c XxYxZ is an arbitrary triadic relation and consider the information about R that is provided by collecting its dyadic projections. To formalize this information define the "projective triple" of R as follows:

Jon Awbrey

12,080

edits