# Difference between revisions of "Sign relational complex"

Jon Awbrey (talk | contribs) (copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author) |
Jon Awbrey (talk | contribs) (trim lead) |
||

(One intermediate revision by the same user not shown) | |||

Line 1: | Line 1: | ||

− | In [[semiotics]], a '''sign relational complex''' is a generalization of a [[sign relation]] that allows for empty | + | In [[semiotics]], a '''sign relational complex''' is a generalization of a [[sign relation]], one that allows for empty entries in the sign relational triples of the form (object, sign, interpretant). |

Generally speaking, when it comes to things that are being contemplated as ostensible or potential signs of other things, neither the existence nor the uniqueness of the elements appearing in the sign relation is guaranteed. For example, the reference of a putative sign to its putative objects may actually achieve reference to zero, to one, or to many objects. A proper treatment of this complication calls for the conception of something slightly more general than a sign relation proper, namely, a sign relational complex. In effect, expressed in the roughest practical terms, this allows for ''missing data'' in the columns of the relational database table for the sign relation in question. Typically one operates on the default assumption that all of the roles of elementary sign relations are actually filled, but remains wary enough of the possible exceptions to deal with them on an ''ad hoc'' basis. | Generally speaking, when it comes to things that are being contemplated as ostensible or potential signs of other things, neither the existence nor the uniqueness of the elements appearing in the sign relation is guaranteed. For example, the reference of a putative sign to its putative objects may actually achieve reference to zero, to one, or to many objects. A proper treatment of this complication calls for the conception of something slightly more general than a sign relation proper, namely, a sign relational complex. In effect, expressed in the roughest practical terms, this allows for ''missing data'' in the columns of the relational database table for the sign relation in question. Typically one operates on the default assumption that all of the roles of elementary sign relations are actually filled, but remains wary enough of the possible exceptions to deal with them on an ''ad hoc'' basis. | ||

==See also== | ==See also== | ||

− | { | + | |

− | + | {{col-begin}} | |

+ | {{col-break}} | ||

* [[Relation (mathematics)|Relation]] | * [[Relation (mathematics)|Relation]] | ||

* [[Semeiotic]] | * [[Semeiotic]] | ||

* [[Semiosis]] | * [[Semiosis]] | ||

* [[Semiotics]] | * [[Semiotics]] | ||

− | + | {{col-break}} | |

+ | * [[Relation theory]] | ||

* [[Sign relation]] | * [[Sign relation]] | ||

* [[Simplicial complex]] | * [[Simplicial complex]] | ||

− | |||

* [[Triadic relation]] | * [[Triadic relation]] | ||

− | + | {{col-end}} |

## Latest revision as of 15:00, 7 November 2010

In semiotics, a **sign relational complex** is a generalization of a sign relation, one that allows for empty entries in the sign relational triples of the form (object, sign, interpretant).

Generally speaking, when it comes to things that are being contemplated as ostensible or potential signs of other things, neither the existence nor the uniqueness of the elements appearing in the sign relation is guaranteed. For example, the reference of a putative sign to its putative objects may actually achieve reference to zero, to one, or to many objects. A proper treatment of this complication calls for the conception of something slightly more general than a sign relation proper, namely, a sign relational complex. In effect, expressed in the roughest practical terms, this allows for *missing data* in the columns of the relational database table for the sign relation in question. Typically one operates on the default assumption that all of the roles of elementary sign relations are actually filled, but remains wary enough of the possible exceptions to deal with them on an *ad hoc* basis.