12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday April 15, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 22:06, 30 December 2012
, 22:06, 30 December 2012→6.35. Reducibility of Sign Relations: markup
Line 8,775:
Line 8,775:
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.
−
===6.35. Reducibility of Sign Relations===
===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>
<pre>
−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:
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:
