Triadic relation - Revision history

Jon Awbrey: update

2015-11-16T21:25:38Z

update

← Older revision		Revision as of 21:25, 16 November 2015
Line 351:		Line 351:
	* [http://mywikibiz.com/Triadic_relation Triadic Relation], [http://mywikibiz.com/ MyWikiBiz]		* [http://mywikibiz.com/Triadic_relation Triadic Relation], [http://mywikibiz.com/ MyWikiBiz]
	* [http://planetmath.org/TriadicRelation Triadic Relation], [http://planetmath.org/ PlanetMath]		* [http://planetmath.org/TriadicRelation Triadic Relation], [http://planetmath.org/ PlanetMath]
			* [http://wikinfo.org/w/index.php/Triadic_relation Triadic Relation], [http://wikinfo.org/w/ Wikinfo]
	* [http://en.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://en.wikiversity.org/ Wikiversity]		* [http://en.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://en.wikiversity.org/ Wikiversity]
	* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://beta.wikiversity.org/ Wikiversity Beta]		* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://beta.wikiversity.org/ Wikiversity Beta]

Jon Awbrey: update

2015-11-15T22:04:05Z

update

← Older revision		Revision as of 22:04, 15 November 2015
Line 232:		Line 232:
	\| <math>\mathrm{B}\!</math>		\| <math>\mathrm{B}\!</math>
	\| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>		\| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
	\| <math>{}{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>		\| <math>{}^{\backprime\backprime} \mathrm{i} {}^{\prime\prime}\!</math>
	\|}		\|}

Line 241:		Line 241:
	===Focal nodes===		===Focal nodes===

	~~{{col-begin}}~~
	~~{{col-break}}~~
	* [[Inquiry Live]]		* [[Inquiry Live]]
	~~{{col-break}}~~
	* [[Logic Live]]		* [[Logic Live]]
	~~{{col-end}}~~

	===Peer nodes===		===Peer nodes===

	~~{{col-begin}}~~
	~~{{col-break}}~~
	* [http://intersci.ss.uci.edu/wiki/index.php/Triadic_relation Triadic Relation @ InterSciWiki]		* [http://intersci.ss.uci.edu/wiki/index.php/Triadic_relation Triadic Relation @ InterSciWiki]
	* [http://mywikibiz.com/Triadic_relation Triadic Relation @ MyWikiBiz]		* [http://mywikibiz.com/Triadic_relation Triadic Relation @ MyWikiBiz]
	~~{{col-break}}~~		* [http://ref.subwiki.org/wiki/Triadic_relation Triadic Relation @ Subject Wikis]
			* [http://en.wikiversity.org/wiki/Triadic_relation Triadic Relation @ Wikiversity]
	* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation @ Wikiversity Beta]		* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation @ Wikiversity Beta]
	* [http://ref.subwiki.org/wiki/Triadic_relation Triadic Relation @ Subject Wikis]
	~~{{col-end}}~~

	===Logical operators===		===Logical operators===
Line 355:		Line 348:
	Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.		Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.

	~~{{col-begin}}~~		* [http://intersci.ss.uci.edu/wiki/index.php/Triadic_relation Triadic Relation], [http://intersci.ss.uci.edu/ InterSciWiki]
	~~{{col-break}}~~
	* [http://mywikibiz.com/Triadic_relation Triadic Relation], [http://mywikibiz.com/ MyWikiBiz]		* [http://mywikibiz.com/Triadic_relation Triadic Relation], [http://mywikibiz.com/ MyWikiBiz]
	* [http://mathweb.org/wiki/Triadic_relation Triadic Relation], [http://mathweb.org/ MathWeb Wiki]
	~~{{col-break}}~~
	* [http://planetmath.org/TriadicRelation Triadic Relation], [http://planetmath.org/ PlanetMath]		* [http://planetmath.org/TriadicRelation Triadic Relation], [http://planetmath.org/ PlanetMath]
			* [http://en.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://en.wikiversity.org/ Wikiversity]
	* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://beta.wikiversity.org/ Wikiversity Beta]		* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://beta.wikiversity.org/ Wikiversity Beta]
	~~{{col-break}}~~
	* [http://getwiki.net/-Triadic_Relation Triadic Relation], [http://getwiki.net/ GetWiki]
	* [http://en.wikipedia.org/w/index.php?title=Triadic_relation&oldid=108548758 Triadic Relation], [http://en.wikipedia.org/ Wikipedia]		* [http://en.wikipedia.org/w/index.php?title=Triadic_relation&oldid=108548758 Triadic Relation], [http://en.wikipedia.org/ Wikipedia]
	~~{{col-end}}~~

	[[Category:Artificial Intelligence]]		[[Category:Artificial Intelligence]]
Line 384:		Line 372:
	[[Category:Philosophy]]		[[Category:Philosophy]]
	[[Category:Pragmatics]]		[[Category:Pragmatics]]
			[[Category:Pragmatism]]
			[[Category:Relation Theory]]
	[[Category:Semantics]]		[[Category:Semantics]]
	[[Category:Semiotics]]		[[Category:Semiotics]]
	[[Category:Syntax]]		[[Category:Syntax]]

Jon Awbrey: update

2013-10-25T19:40:03Z

update

Show changes

Jon Awbrey: + article

2010-06-18T20:18:50Z

+ article

New page

☞ This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].

In [[logic]], [[mathematics]], and [[semiotics]], a '''triadic relation''' is an important special case of a [[relation (mathematics)|polyadic or finitary relation]], one in which the number of places in the relation is three. In other language that is often used, a triadic relation is called a '''ternary relation'''. One may also see the adjectives ''3-adic'', ''3-ary'', ''3-dimensional'', or ''3-place'' being used to describe these relations.

Mathematics is positively rife with examples of 3-adic relations, and a [[sign relation]], the arch-idea of the whole field of semiotics, is a special case of a 3-adic relation. Therefore it will be useful to consider a few concrete examples from each of these two realms.

==Examples from mathematics==

For the sake of topics to be taken up later, it is useful to examine a pair of 3-adic relations in tandem, <math>L_0\!</math> and <math>L_1,\!</math> that can be described in the following manner.

The first order of business is to define the space in which the relations <math>L_0\!</math> and <math>L_1\!</math> take up residence. This space is constructed as a 3-fold [[cartesian power]] in the following way.

The ''[[boolean domain]]'' is the set <math>\mathbb{B} = \{ 0, 1 \}.</math>

The ''plus sign'' <math>^{\backprime\backprime} + ^{\prime\prime},</math> used in the context of the boolean domain <math>\mathbb{B},</math> denotes addition modulo 2. Interpreted for logic, the plus sign can be used to indicate either the boolean operation of ''[[exclusive disjunction]]'', <math>\operatorname{XOR} : \mathbb{B} \times \mathbb{B} \to \mathbb{B},</math> or the boolean relation of ''logical inequality'', <math>\operatorname{NEQ} \subseteq \mathbb{B} \times \mathbb{B}.</math>

The third cartesian power of <math>\mathbb{B}</math> is the set <math>\mathbb{B}^3 = \mathbb{B} \times \mathbb{B} \times \mathbb{B} = \{ (x_1, x_2, x_3) : x_j \in \mathbb{B} ~\text{for}~ j = 1, 2, 3 \}.</math>

In what follows, the space <math>X \times Y \times Z</math> is isomorphic to <math>\mathbb{B} \times \mathbb{B} \times \mathbb{B} ~=~ \mathbb{B}^3.</math>

The relation <math>L_0\!</math> is defined as follows:

: <math>L_0 = \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 0 \}.</math>

The relation <math>L_0\!</math> is the set of four triples enumerated here:

: <math>L_0 = \{ (0, 0, 0), (0, 1, 1), (1, 0, 1), (1, 1, 0) \}.\!</math>

The relation <math>L_1\!</math> is defined as follows:

: <math>L_1 = \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 1 \}.</math>

The relation <math>L_1\!</math> is the set of four triples enumerated here:

: <math>L_1 = \{ (0, 0, 1), (0, 1, 0), (1, 0, 0), (1, 1, 1) \}.\!</math>

The triples that make up the relations <math>L_0\!</math> and <math>L_1\!</math> are conveniently arranged in the form of ''[[relational database|relational data tables]]'', as follows:

 

{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:#f8f8ff; font-weight:bold; text-align:center; width:60%"
|+ <math>L_0 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 0 \}</math>
|- style="background:#e6e6ff"
! <math>X\!</math> !! <math>Y\!</math> !! <math>Z\!</math>
|-
| <math>0\!</math> || <math>0\!</math> || <math>0\!</math>
|-
| <math>0\!</math> || <math>1\!</math> || <math>1\!</math>
|-
| <math>1\!</math> || <math>0\!</math> || <math>1\!</math>
|-
| <math>1\!</math> || <math>1\!</math> || <math>0\!</math>
|}

 

{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:#f8f8ff; font-weight:bold; text-align:center; width:60%"
|+ <math>L_1 ~=~ \{ (x, y, z) \in \mathbb{B}^3 : x + y + z = 1 \}</math>
|- style="background:#e6e6ff"
! <math>X\!</math> !! <math>Y\!</math> !! <math>Z\!</math>
|-
| <math>0\!</math> || <math>0\!</math> || <math>1\!</math>
|-
| <math>0\!</math> || <math>1\!</math> || <math>0\!</math>
|-
| <math>1\!</math> || <math>0\!</math> || <math>0\!</math>
|-
| <math>1\!</math> || <math>1\!</math> || <math>1\!</math>
|}

 

==Examples from semiotics==

The study of signs — the full variety of significant forms of expression — in relation to the things that signs are significant ''of'', and in relation to the beings that signs are significant ''to'', is known as ''[[semiotics]]'' or the ''theory of signs''. As just described, semiotics treats of a 3-place relation among ''signs'', their ''objects'', and their ''interpreters''.

The term ''[[semiosis]]'' refers to any activity or process that involves signs. Studies of semiosis that deal with its more abstract form are not concerned with every concrete detail of the entities that act as signs, as objects, or as agents of semiosis, but only with the most salient patterns of relationship among these three roles. In particular, the formal theory of signs does not consider all of the properties of the interpretive agent but only the more striking features of the impressions that signs make on a representative interpreter. In its formal aspects, that impact or influence may be treated as just another sign, called the ''interpretant sign'', or the ''interpretant'' for short. Such a 3-adic relation, among objects, signs, and interpretants, is called a ''[[sign relation]]''.

For example, consider the aspects of sign use that concern two people — let us say <math>\operatorname{Ann}</math> and <math>\operatorname{Bob}\!</math> — in using their own proper names, <math>^{\backprime\backprime} \operatorname{Ann} ^{\prime\prime}</math> and <math>^{\backprime\backprime} \operatorname{Bob} ^{\prime\prime},</math> together with the pronouns, <math>^{\backprime\backprime} \operatorname{I} ^{\prime\prime}</math> and <math>^{\backprime\backprime} \operatorname{you} ^{\prime\prime}.</math> For brevity, these four signs may be abbreviated to the set <math>\{ \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime} \, \}.</math> The abstract consideration of how <math>\operatorname{A}</math> and <math>\operatorname{B}</math> use this set of signs to refer to themselves and each other leads to the contemplation of a pair of 3-adic relations, the sign relations <math>L_\operatorname{A}</math> and <math>L_\operatorname{B},</math> that reflect the differential use of these signs by <math>\operatorname{A}</math> and <math>\operatorname{B},</math> respectively.

Each of the sign relations, <math>L_\operatorname{A}</math> and <math>L_\operatorname{B},</math> consists of eight triples of the form <math>(x, y, z),\!</math> where the ''object'' <math>x\!</math> is an element of the ''object domain'' <math>O = \{ \operatorname{A}, \operatorname{B} \},</math> where the ''sign'' <math>y\!</math> is an element of the ''sign domain'' <math>S\!,</math> where the ''interpretant sign'' <math>z\!</math> is an element of the interpretant domain <math>I,\!</math> and where it happens in this case that <math>S = I = \{ \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime} \, \}.</math> In general, it is convenient to refer to the union <math>S \cup I</math> as the ''syntactic domain'', but in this case <math>S ~=~ I ~=~ S \cup I.</math>

The set-up so far is summarized as follows:

{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{ccc}
L_\operatorname{A}, L_\operatorname{B} & \subseteq & O \times S \times I \\
\\
O & = & \{ \operatorname{A}, \operatorname{B} \} \\
\\
S & = & \{ \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime} \, \} \\
\\
I & = & \{ \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime} \, \} \\
\\
\end{array}</math>
|}

The relation <math>L_\operatorname{A}</math> is the set of eight triples enumerated here:

{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{cccccc}
\{ &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}), &
\\
&
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}) &
\}.
\end{array}</math>
|}

The triples in <math>L_\operatorname{A}</math> represent the way that interpreter <math>\operatorname{A}</math> uses signs. For example, the listing of the triple <math>(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime})</math> in <math>L_\operatorname{A}</math> represents the fact that <math>\operatorname{A}</math> uses <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math> to mean the same thing that <math>\operatorname{A}</math> uses <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math> to mean, namely, <math>\operatorname{B}.</math>

The relation <math>L_\operatorname{B}</math> is the set of eight triples enumerated here:

{| align="center" cellpadding="8" width="90%"
|
<math>\begin{array}{cccccc}
\{ &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{A} ^{\prime\prime}), &
(\operatorname{A}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{u} ^{\prime\prime}), &
\\
&
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime}), &
(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}) &
\}.
\end{array}</math>
|}

The triples in <math>L_\operatorname{B}</math> represent the way that interpreter <math>\operatorname{B}</math> uses signs. For example, the listing of the triple <math>(\operatorname{B}, \, ^{\backprime\backprime} \operatorname{i} ^{\prime\prime}, \, ^{\backprime\backprime} \operatorname{B} ^{\prime\prime})</math> in <math>L_\operatorname{B}</math> represents the fact that <math>\operatorname{B}</math> uses <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math> to mean the same thing that <math>\operatorname{B}</math> uses <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math> to mean, namely, <math>\operatorname{B}.</math>

The triples that make up the relations <math>L_\operatorname{A}</math> and <math>L_\operatorname{B}</math> are conveniently arranged in the form of ''[[relational database|relational data tables]]'', as follows:

 

{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:#f8f8ff; font-weight:bold; text-align:center; width:60%"
|+ <math>L_\operatorname{A} ~=~ \operatorname{Sign~Relation~of~Interpreter~A}</math>
|- style="background:#e6e6ff"
! style="width:33%" | <math>\operatorname{Object}</math>
! style="width:33%" | <math>\operatorname{Sign}</math>
! style="width:33%" | <math>\operatorname{Interpretant}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
|}

 

{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:#f8f8ff; font-weight:bold; text-align:center; width:60%"
|+ <math>L_\operatorname{B} ~=~ \operatorname{Sign~Relation~of~Interpreter~B}</math>
|- style="background:#e6e6ff"
! style="width:33%" | <math>\operatorname{Object}</math>
! style="width:33%" | <math>\operatorname{Sign}</math>
! style="width:33%" | <math>\operatorname{Interpretant}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
|-
|<math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{A} ^{\prime\prime}</math>
|-
| <math>\operatorname{A}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{u} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{B} ^{\prime\prime}</math>
|-
| <math>\operatorname{B}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
| <math>^{\backprime\backprime} \operatorname{i} ^{\prime\prime}</math>
|}

 

==Syllabus==

===Focal nodes===

{{col-begin}}
{{col-break}}
* [[Inquiry Live]]
{{col-break}}
* [[Logic Live]]
{{col-end}}

===Peer nodes===

{{col-begin}}
{{col-break}}
* [http://mywikibiz.com/Triadic_relation Triadic Relation @ MyWikiBiz]
* [http://mathweb.org/wiki/Triadic_relation Triadic Relation @ MathWeb Wiki]
* [http://netknowledge.org/wiki/Triadic_relation Triadic Relation @ NetKnowledge]
* [http://wiki.oercommons.org/mediawiki/index.php/Triadic_relation Triadic Relation @ OER Commons]
{{col-break}}
* [http://p2pfoundation.net/Triadic_Relation Triadic Relation @ P2P Foundation]
* [http://semanticweb.org/wiki/Triadic_relation Triadic Relation @ SemanticWeb]
* [http://ref.subwiki.org/wiki/Triadic_relation Triadic Relation @ Subject Wikis]
* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation @ Wikiversity Beta]
{{col-end}}

===Logical operators===

{{col-begin}}
{{col-break}}
* [[Exclusive disjunction]]
* [[Logical conjunction]]
* [[Logical disjunction]]
* [[Logical equality]]
{{col-break}}
* [[Logical implication]]
* [[Logical NAND]]
* [[Logical NNOR]]
* [[Logical negation|Negation]]
{{col-end}}

===Related topics===

{{col-begin}}
{{col-break}}
* [[Ampheck]]
* [[Boolean domain]]
* [[Boolean function]]
* [[Boolean-valued function]]
* [[Differential logic]]
{{col-break}}
* [[Logical graph]]
* [[Minimal negation operator]]
* [[Multigrade operator]]
* [[Parametric operator]]
* [[Peirce's law]]
{{col-break}}
* [[Propositional calculus]]
* [[Sole sufficient operator]]
* [[Truth table]]
* [[Universe of discourse]]
* [[Zeroth order logic]]
{{col-end}}

===Relational concepts===

{{col-begin}}
{{col-break}}
* [[Continuous predicate]]
* [[Hypostatic abstraction]]
* [[Logic of relatives]]
* [[Logical matrix]]
{{col-break}}
* [[Relation (mathematics)|Relation]]
* [[Relation composition]]
* [[Relation construction]]
* [[Relation reduction]]
{{col-break}}
* [[Relation theory]]
* [[Relative term]]
* [[Sign relation]]
* [[Triadic relation]]
{{col-end}}

===Information, Inquiry===

{{col-begin}}
{{col-break}}
* [[Inquiry]]
* [[Dynamics of inquiry]]
{{col-break}}
* [[Semeiotic]]
* [[Logic of information]]
{{col-break}}
* [[Descriptive science]]
* [[Normative science]]
{{col-break}}
* [[Pragmatic maxim]]
* [[Truth theory]]
{{col-end}}

===Related articles===

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Semiotic_Information Jon Awbrey, “Semiotic Information”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Introduction_to_Inquiry_Driven_Systems Jon Awbrey, “Introduction To Inquiry Driven Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Essays/Prospects_For_Inquiry_Driven_Systems Jon Awbrey, “Prospects For Inquiry Driven Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Inquiry_Driven_Systems Jon Awbrey, “Inquiry Driven Systems : Inquiry Into Inquiry”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Propositional_Equation_Reasoning_Systems Jon Awbrey, “Propositional Equation Reasoning Systems”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_:_Introduction Jon Awbrey, “Differential Logic : Introduction”]

* [http://planetmath.org/encyclopedia/DifferentialPropositionalCalculus.html Jon Awbrey, “Differential Propositional Calculus”]

* [http://mywikibiz.com/Directory:Jon_Awbrey/Papers/Differential_Logic_and_Dynamic_Systems_2.0 Jon Awbrey, “Differential Logic and Dynamic Systems”]

==Document history==

Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.

{{col-begin}}
{{col-break}}
* [http://mywikibiz.com/Triadic_relation Triadic Relation], [http://mywikibiz.com/ MyWikiBiz]
* [http://mathweb.org/wiki/Triadic_relation Triadic Relation], [http://mathweb.org/ MathWeb Wiki]
* [http://netknowledge.org/wiki/Triadic_relation Triadic Relation], [http://netknowledge.org/ NetKnowledge]
* [http://wiki.oercommons.org/mediawiki/index.php/Triadic_relation Triadic Relation], [http://wiki.oercommons.org/ OER Commons]
* [http://p2pfoundation.net/Triadic_Relation Triadic Relation], [http://p2pfoundation.net/ P2P Foundation]
* [http://semanticweb.org/wiki/Triadic_relation Triadic Relation], [http://semanticweb.org/ SemanticWeb]
{{col-break}}
* [http://planetmath.org/encyclopedia/TriadicRelation.html Triadic Relation], [http://planetmath.org/ PlanetMath]
* [http://beta.wikiversity.org/wiki/Triadic_relation Triadic Relation], [http://beta.wikiversity.org/ Wikiversity Beta]
* [http://getwiki.net/-Triadic_Relation Triadic Relation], [http://getwiki.net/ GetWiki]
* [http://wikinfo.org/index.php/Triadic_relation Triadic Relation], [http://wikinfo.org/ Wikinfo]
* [http://textop.org/wiki/index.php?title=Triadic_relation Triadic Relation], [http://textop.org/wiki/ Textop Wiki]
* [http://en.wikipedia.org/w/index.php?title=Triadic_relation&oldid=108548758 Triadic Relation], [http://en.wikipedia.org/ Wikipedia]
{{col-end}}

[[Category:Inquiry]]
[[Category:Open Educational Resource]]
[[Category:Peer Educational Resource]]
[[Category:Artificial Intelligence]]
[[Category:Cognitive Sciences]]
[[Category:Computer Science]]
[[Category:Formal Sciences]]
[[Category:Hermeneutics]]
[[Category:Information Systems]]
[[Category:Information Theory]]
[[Category:Intelligence Amplification]]
[[Category:Knowledge Representation]]
[[Category:Linguistics]]
[[Category:Logic]]
[[Category:Mathematics]]
[[Category:Philosophy]]
[[Category:Pragmatics]]
[[Category:Semantics]]
[[Category:Semiotics]]
[[Category:Syntax]]