Triadic relation

☞ This page belongs to resource collections on Logic and Inquiry.

In logic, mathematics, and semiotics, a triadic relation is an important special case of a 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

[edit | edit source]

For the sake of topics to be taken up later, it is useful to examine a pair of 3-adic relations in tandem,  L 0 {\displaystyle L_{0}\\!} and  L 1 , {\displaystyle L_{1},\\!} that can be described in the following manner.

The first order of business is to define the space in which the relations  L 0 {\displaystyle L_{0}\\!} and  L 1 {\displaystyle L_{1}\\!} take up residence. This space is constructed as a 3-fold cartesian power in the following way.

The boolean domain is the set  B = { 0 , 1 } . {\displaystyle \mathbb {B} =\\{0,1\\}.\\!}

The plus sign ‵ ‵ + ′ ′ , {\displaystyle {}^{\backprime \backprime }+{}^{\prime \prime },\\!} used in the context of the boolean domain  B , {\displaystyle \mathbb {B} ,\\!} denotes addition modulo 2. Interpreted for logic, the plus sign can be used to indicate either the boolean operation of exclusive disjunction,  X O R : B × B -> B , {\displaystyle \mathrm {XOR} :\mathbb {B} \times \mathbb {B} \to \mathbb {B} ,\\!} or the boolean relation of logical inequality,  N E Q ⊆ B × B . {\displaystyle \mathrm {NEQ} \subseteq \mathbb {B} \times \mathbb {B} .\\!}

The third cartesian power of  B {\displaystyle \mathbb {B} \\!} is the set  B 3 = B × B × B = { ( x 1 , x 2 , x 3 ) : x j ∈ B for j = 1 , 2 , 3 } . {\displaystyle \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\\}.\\!}

In what follows, the space  X × Y × Z {\displaystyle X\times Y\times Z\\!} is isomorphic to  B × B × B = B 3 . {\displaystyle \mathbb {B} \times \mathbb {B} \times \mathbb {B} ~=~\mathbb {B} ^{3}.\\!}

The relation  L 0 {\displaystyle L_{0}\\!} is defined as follows:

L 0 = { ( x , y , z ) ∈ B 3 : x + y + z = 0 } . {\displaystyle L_{0}~=~\\{(x,y,z)\in \mathbb {B} ^{3}:x+y+z=0\\}.~\\!}

The relation  L 0 {\displaystyle L_{0}\\!} is the set of four triples enumerated here:

L 0 = { ( 0 , 0 , 0 ) , ( 0 , 1 , 1 ) , ( 1 , 0 , 1 ) , ( 1 , 1 , 0 ) } . {\displaystyle L_{0}~=~\\{(0,0,0),(0,1,1),(1,0,1),(1,1,0)\\}.\\!}

The relation  L 1 {\displaystyle L_{1}\\!} is defined as follows:

L 1 = { ( x , y , z ) ∈ B 3 : x + y + z = 1 } . {\displaystyle L_{1}~=~\\{(x,y,z)\in \mathbb {B} ^{3}:x+y+z=1\\}.~\\!}

The relation  L 1 {\displaystyle L_{1}\\!} is the set of four triples enumerated here:

L 1 = { ( 0 , 0 , 1 ) , ( 0 , 1 , 0 ) , ( 1 , 0 , 0 ) , ( 1 , 1 , 1 ) } . {\displaystyle L_{1}~=~\\{(0,0,1),(0,1,0),(1,0,0),(1,1,1)\\}.\\!}

The triples that make up the relations  L 0 {\displaystyle L_{0}\\!} and  L 1 {\displaystyle L_{1}\\!} are conveniently arranged in the form of relational data tables, as follows:

L 0 = { ( x , y , z ) ∈ B 3 : x + y + z = 0 } {\displaystyle L_{0}~=~\\{(x,y,z)\in \mathbb {B} ^{3}:x+y+z=0\\}\\!} X {\displaystyle X\\!} |  Y {\displaystyle Y\\!} |  Z {\displaystyle Z\\!}

|
|

0 {\displaystyle 0\\!} |  0 {\displaystyle 0\\!} |  0 {\displaystyle 0\\!}
0 {\displaystyle 0\\!} |  1 {\displaystyle 1\\!} |  1 {\displaystyle 1\\!}
1 {\displaystyle 1\\!} |  0 {\displaystyle 0\\!} |  1 {\displaystyle 1\\!}
1 {\displaystyle 1\\!} |  1 {\displaystyle 1\\!} |  0 {\displaystyle 0\\!}

L 1 = { ( x , y , z ) ∈ B 3 : x + y + z = 1 } {\displaystyle L_{1}~=~\\{(x,y,z)\in \mathbb {B} ^{3}:x+y+z=1\\}\\!} X {\displaystyle X\\!} |  Y {\displaystyle Y\\!} |  Z {\displaystyle Z\\!}

|
|

0 {\displaystyle 0\\!} |  0 {\displaystyle 0\\!} |  1 {\displaystyle 1\\!}
0 {\displaystyle 0\\!} |  1 {\displaystyle 1\\!} |  0 {\displaystyle 0\\!}
1 {\displaystyle 1\\!} |  0 {\displaystyle 0\\!} |  0 {\displaystyle 0\\!}
1 {\displaystyle 1\\!} |  1 {\displaystyle 1\\!} |  1 {\displaystyle 1\\!}

## Examples from semiotics

[edit | edit source]

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 interpretants.

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  A n n {\displaystyle \mathrm {Ann} \\!} and  B o b {\displaystyle \mathrm {Bob} \\!} -- in using their own proper names,  ‵ ‵ A n n ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {Ann} {}^{\prime \prime }\\!} and  ‵ ‵ B o b ′ ′ , {\displaystyle {}^{\backprime \backprime }\mathrm {Bob} {}^{\prime \prime },\\!} together with the pronouns,  ‵ ‵ I ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {I} {}^{\prime \prime }\\!} and  ‵ ‵ y o u ′ ′ . {\displaystyle {}^{\backprime \backprime }\mathrm {you} {}^{\prime \prime }.\\!} For brevity, these four signs may be abbreviated to the set  { ‵ ‵ A ′ ′ , ‵ ‵ B ′ ′ , ‵ ‵ i ′ ′ , ‵ ‵ u ′ ′ } . {\displaystyle \\{\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\,\\}.\\!} The abstract consideration of how  A {\displaystyle \mathrm {A} \\!} and  B {\displaystyle \mathrm {B} \\!} 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  L A {\displaystyle L_{\mathrm {A} }\\!} and  L B , {\displaystyle L_{\mathrm {B} },\\!} that reflect the differential use of these signs by  A {\displaystyle \mathrm {A} \\!} and  B , {\displaystyle \mathrm {B} ,\\!} respectively.

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

The set-up so far is summarized as follows:

L A , L B ⊆ O × S × I O = { A , B } S = { ‵ ‵ A ′ ′ , ‵ ‵ B ′ ′ , ‵ ‵ i ′ ′ , ‵ ‵ u ′ ′ } I = { ‵ ‵ A ′ ′ , ‵ ‵ B ′ ′ , ‵ ‵ i ′ ′ , ‵ ‵ u ′ ′ } {\displaystyle {\begin{array}{ccc}L_{\mathrm {A} },L_{\mathrm {B} }&\subseteq &O\times S\times I\\\\\\\O&=&\\{\mathrm {A} ,\mathrm {B} \\}\\\\\\\S&=&\\{\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\,\\}\\\\\\\I&=&\\{\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\,\\}\\\\\\\\\end{array}}}

The relation  L A {\displaystyle L_{\mathrm {A} }\\!} is the set of eight triples enumerated here:

{ ( A , ‵ ‵ A ′ ′ , ‵ ‵ A ′ ′ ) , ( A , ‵ ‵ A ′ ′ , ‵ ‵ i ′ ′ ) , ( A , ‵ ‵ i ′ ′ , ‵ ‵ A ′ ′ ) , ( A , ‵ ‵ i ′ ′ , ‵ ‵ i ′ ′ ) , ( B , ‵ ‵ B ′ ′ , ‵ ‵ B ′ ′ ) , ( B , ‵ ‵ B ′ ′ , ‵ ‵ u ′ ′ ) , ( B , ‵ ‵ u ′ ′ , ‵ ‵ B ′ ′ ) , ( B , ‵ ‵ u ′ ′ , ‵ ‵ u ′ ′ ) } . {\displaystyle {\begin{array}{cccccc}\\{&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }),&\\\&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime })&\\}.\end{array}}}

The triples in  L A {\displaystyle L_{\mathrm {A} }\\!} represent the way that interpreter  A {\displaystyle \mathrm {A} \\!} uses signs. For example, the listing of the triple  ( B , ‵ ‵ u ′ ′ , ‵ ‵ B ′ ′ ) {\displaystyle (\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime })\\!} in  L A {\displaystyle L_{\mathrm {A} }\\!} represents the fact that  A {\displaystyle \mathrm {A} \\!} uses  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} to mean the same thing that  A {\displaystyle \mathrm {A} \\!} uses  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!} to mean, namely,  B . {\displaystyle \mathrm {B} .\\!}

The relation  L B {\displaystyle L_{\mathrm {B} }\\!} is the set of eight triples enumerated here:

{ ( A , ‵ ‵ A ′ ′ , ‵ ‵ A ′ ′ ) , ( A , ‵ ‵ A ′ ′ , ‵ ‵ u ′ ′ ) , ( A , ‵ ‵ u ′ ′ , ‵ ‵ A ′ ′ ) , ( A , ‵ ‵ u ′ ′ , ‵ ‵ u ′ ′ ) , ( B , ‵ ‵ B ′ ′ , ‵ ‵ B ′ ′ ) , ( B , ‵ ‵ B ′ ′ , ‵ ‵ i ′ ′ ) , ( B , ‵ ‵ i ′ ′ , ‵ ‵ B ′ ′ ) , ( B , ‵ ‵ i ′ ′ , ‵ ‵ i ′ ′ ) } . {\displaystyle {\begin{array}{cccccc}\\{&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }),&(\mathrm {A} ,\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }),&\\\&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }),&(\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime })&\\}.\end{array}}}

The triples in  L B {\displaystyle L_{\mathrm {B} }\\!} represent the way that interpreter  B {\displaystyle \mathrm {B} \\!} uses signs. For example, the listing of the triple  ( B , ‵ ‵ i ′ ′ , ‵ ‵ B ′ ′ ) {\displaystyle (\mathrm {B} ,\,{}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime },\,{}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime })\\!} in  L B {\displaystyle L_{\mathrm {B} }\\!} represents the fact that  B {\displaystyle \mathrm {B} \\!} uses  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} to mean the same thing that  B {\displaystyle \mathrm {B} \\!} uses  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!} to mean, namely,  B . {\displaystyle \mathrm {B} .\\!}

The triples that make up the relations  L A {\displaystyle L_{\mathrm {A} }\\!} and  L B {\displaystyle L_{\mathrm {B} }\\!} are conveniently arranged in the form of relational data tables, as follows:

L A = Sign Relation of Interpreter A {\displaystyle L_{\mathrm {A} }~=~{\text{Sign Relation of Interpreter A}}\\!} Object {\displaystyle {\text{Object}}\\!} |  Sign {\displaystyle {\text{Sign}}\\!} |  Interpretant {\displaystyle {\text{Interpretant}}\\!}

|
|

A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!}

L B = Sign Relation of Interpreter B {\displaystyle L_{\mathrm {B} }~=~{\text{Sign Relation of Interpreter B}}\\!} Object {\displaystyle {\text{Object}}\\!} |  Sign {\displaystyle {\text{Sign}}\\!} |  Interpretant {\displaystyle {\text{Interpretant}}\\!}

|
|

A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!} |  ‵ ‵ A ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {A} {}^{\prime \prime }\\!}
A {\displaystyle \mathrm {A} \\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!} |  ‵ ‵ u ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {u} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!} |  ‵ ‵ B ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {B} {}^{\prime \prime }\\!}
B {\displaystyle \mathrm {B} \\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!} |  ‵ ‵ i ′ ′ {\displaystyle {}^{\backprime \backprime }\mathrm {i} {}^{\prime \prime }\\!}

## Syllabus

[edit | edit source]

### Focal nodes

[edit | edit source]

* Inquiry Live
* Logic Live

### Peer nodes

[edit | edit source]

* Triadic Relation @ InterSciWiki
* Triadic Relation @ Subject Wikis
* Triadic Relation @ Wikiversity
* Triadic Relation @ Wikiversity Beta

### Logical operators

[edit | edit source]

* Exclusive disjunction
* Logical conjunction
* Logical disjunction
* Logical equality

* Logical implication
* Logical NAND
* Logical NNOR
* Negation

|

### Related topics

[edit | edit source]

* Ampheck
* Boolean domain
* Boolean function
* Boolean-valued function
* Differential logic

* Logical graph
* Minimal negation operator
* Multigrade operator
* Parametric operator
* Peirce's law

* Propositional calculus
* Sole sufficient operator
* Truth table
* Universe of discourse
* Zeroth order logic

|
|

### Relational concepts

[edit | edit source]

* Continuous predicate
* Hypostatic abstraction
* Logic of relatives
* Logical matrix

* Relation
* Relation composition
* Relation construction
* Relation reduction

* Relation theory
* Relative term
* Sign relation
* Triadic relation

|
|

### Information, Inquiry

[edit | edit source]

* Inquiry
* Dynamics of inquiry

* Semeiotic
* Logic of information

* Descriptive science
* Normative science

* Pragmatic maxim
* Truth theory

|
|
|

### Related articles

[edit | edit source]

* Cactus Language
* Futures Of Logical Graphs
* Propositional Equation Reasoning Systems

* Differential Logic : Introduction
* Differential Propositional Calculus
* Differential Logic and Dynamic Systems

* Introduction to Inquiry Driven Systems
* Prospects for Inquiry Driven Systems
* Inquiry Driven Systems : Inquiry Into Inquiry

|
|

## Document history

[edit | edit source]

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.

* Triadic Relation, InterSciWiki
* Triadic Relation, PlanetMath
* Triadic Relation, Wikiversity
* Triadic Relation, Wikiversity Beta
* Triadic Relation, Wikipedia