Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:49974 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.91) (envelope-from ) id 1gkB4g-0002x1-AW for jbovlaste-admin@lojban.org; Thu, 17 Jan 2019 09:03:29 -0800 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Thu, 17 Jan 2019 09:03:26 -0800 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utkaro -- By krtisfranks Date: Thu, 17 Jan 2019 09:03:26 -0800 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Message-Id: X-Spam-Score: -0.9 (/) X-Spam_score: -0.9 X-Spam_score_int: -8 X-Spam_bar: / In jbovlaste, the user krtisfranks has edited a definition of "utkaro" in the language "English". Differences: 2,2c2,2 < $x_1$ and $x_2$ are path-linked by directed binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ordered list; ce'o), such that no other node exists in the graph to which $x_2$ is connected in the same way/direction. --- > $x_1$ and $x_2$ are path-linked by directed binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ordered list; ce'o), such that no other node exists in the graph ($x_5$) to which $x_2$ is connected in the same way/direction. Old Data: Definition: $x_1$ and $x_2$ are path-linked by directed binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ordered list; ce'o), such that no other node exists in the graph to which $x_2$ is connected in the same way/direction. Notes: $x_2$ is the root/leaf of the predicate (depending on point of view); it is the ultimate ancestor/descendent node in the graph along the path described by $x_4$ for $x_1$ using relation $x_3$. Not all combinations of $x_1$ nodes and $x_3$ relations and $x_4$ paths have such an $x_2$ node, nor is $x_2$ necessarily unique if only $x_1$ and $x_3$ are specified (the same is true if "$x_1$" and "$x_2$" are exchanged in this second clause of this sentence). Use a SE conversion or other permutation on the arguments of $x_3$ in order to change the perspective (for example: if we call $x_2$ a root, then it *might* be the case that $x_1$ is a leaf). All other notes are the same as those for ".{utka}", which should be referenced. Jargon: Gloss Keywords: Word: ultimate path-linked ancestor node, In Sense: Place Keywords: New Data: Definition: $x_1$ and $x_2$ are path-linked by directed binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ordered list; ce'o), such that no other node exists in the graph ($x_5$) to which $x_2$ is connected in the same way/direction. Notes: $x_2$ is the root/leaf of the predicate (depending on point of view); it is the ultimate ancestor/descendent node in the graph along the path described by $x_4$ for $x_1$ using relation $x_3$. Not all combinations of $x_1$ nodes and $x_3$ relations and $x_4$ paths have such an $x_2$ node, nor is $x_2$ necessarily unique if only $x_1$ and $x_3$ are specified (the same is true if "$x_1$" and "$x_2$" are exchanged in this second clause of this sentence). Use a SE conversion or other permutation on the arguments of $x_3$ in order to change the perspective (for example: if we call $x_2$ a root, then it *might* be the case that $x_1$ is a leaf). All other notes are the same as those for ".{utka}", which should be referenced. Jargon: Gloss Keywords: Word: ultimate path-linked ancestor node, In Sense: Place Keywords: You can go to to see it.