11.2 Nesting


If a conceptual graph G is inside the referent of a concept C, then G is said to be nested in C.

This can be done to any depth: G can be nested inside C, which can be nested inside a third context C2. Thus G need not be immediately nested in C, i.e., C need not be the nearest containing concept. We might be able to work our way outwards through several contexts (i.e., containing concepts) before we reach the outermost level.

Let us see an example.


   [Situation: [PartyLight: [PartyLight]->(Attr)->[Blue] ]-
                  <-(Agnt)<-[Blink] ]
   "There is this situation: 
      There is a partylight, 
        which can be described as
          a partylight
            which has an attribute 
            which is blue,
      and the party light 
        is the agent of an act 
        which is Blink"
   "A blue party light is blinking"  

Here, we have two levels of nesting: The PartyLight is described by the graph


. This graph is nested inside the concept (context):

   [PartyLight: [PartyLight]->(Attr)->[Blue] ]

. This concept is then part of a larger graph:

   [PartyLight: [PartyLight]->(Attr)->[Blue] ]<-(Agnt)<-[Blink]

which is then nested inside the "[Situation]" concept (context):

   [Situation: [PartyLight: [PartyLight]->(Attr)->[Blue] ]-
                  <-(Agnt)<-[Blink] ]

Thus we have two levels of nesting.

Immediately nested graphs are referents

It is very important that you understand that the nested graph is the referent of the containing concept. For example,


is the referent of the concept with the type 'PartyLight'. You will remember that this kind of referent is called a descriptor.

Prev: 11.1 Contexts
Up: 11 Nested graphs
Next: 11.3 Co-nesting