12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Wednesday November 13, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 19:08, 15 August 2011
, 19:08, 15 August 2011→6.16. Recursive Aspects: + raw text
===6.16. Recursive Aspects===
===6.16. Recursive Aspects===
<pre>
There is a one piece of unfinished business concerning the presentation of this example that deserves further comment.
Since the objects of reference, A and B, are imagined to be interpretive agents, it is convenient to use their names to denote the corresponding sign relations. Thus, the interpreters A and B are self referent and mutually referent to the extent that they have names for themselves and each other. However, their discussion as a whole fails to contain any term for itself, and it even lacks a full set of grammatical cases for the objects in it. Whether these recursions and omissions cause any problems for my discussion will depend on the level of interpretive sophistication, not of A and B, but of the external systems of interpretation that are brought to bear on it.
In defining the activities of interpreters A and B as sign relations, I have implicitly specified set theoretic equations of the following form:
A = { <A, "A", "A">, ... , <A, "i", "i">,
<B, "B", "B">, ... , <B, "u", "u"> },
B = { <A, "A", "A">, ... , <A, "u", "u">,
<B, "B", "B">, ... , <B, "i", "i"> }.
The way I read these equations, they do not attempt to define the entities A and B in terms of themselves and each other. Instead, they define the whole instrumental activity of each interpreter, a highly complex duty, in terms of the interpreters' more perfunctory roles as objects of reference, and in terms of their associated actions on signs as mere tokens of each other's existence. In other words, the recursion does not have recourse to the full fledged faculties of A and B, but only to their more inert excipients, their rote performances as inactive objects and passive images whose properly reduced complexities provide grounds for permitting the recursion to fly.
</pre>
===6.17. Patterns of Self-Reference===
===6.17. Patterns of Self-Reference===
