Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Thu, 14 Jan 2021 19:36:44 -0800 Received: from [192.168.123.254] (port=56916 helo=web.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.94) (envelope-from ) id 1l0Fuk-00Cvrv-0C for jbovlaste-admin@lojban.org; Thu, 14 Jan 2021 19:36:44 -0800 Received: by web.digitalkingdom.org (sSMTP sendmail emulation); Fri, 15 Jan 2021 03:36:41 +0000 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utkaje -- By krtisfranks Date: Fri, 15 Jan 2021 03:36:41 +0000 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Message-Id: X-Spam-Score: -2.9 (--) X-Spam_score: -2.9 X-Spam_score_int: -28 X-Spam_bar: -- In jbovlaste, the user krtisfranks has edited a definition of "utkaje" in the language "English". Differences: 5,5c5,5 < Equivalent to "$x_1 x_2$ fo $x_4 x_5$ .{utkaro} fi $x_3$ gi'e se .utkaro fi $x_{3}^{-1}$", where $x_{3}^{-1}$ is binary relation/predicate $x_3$ with the order of its two arguments exchanged (basically: "{se}"-converted). Multiple paths may connect $x_1$ and $x_2$. There may be peripheral branches extending from $x_2$ which are acyclic (or cyclic) such that they contain a node which has a directed distance from $x_2$ which exceeds that of any path from $x_1$ to $x_2$; it is just the case that for any path connecting $x_1$ and $x_2$ in either direction, $x_1$ and $x_2$ are root/leaf nodes thereof. --- > Equivalent to "$x_1 \, x_2$ fo $x_4 \, x_5$ .{utkaro} fi $x_3$ gi'e se .utkaro fi $x_{3}^{-1}$", where $x_{3}^{-1}$ is binary relation/predicate $x_3$ with the order of its two arguments exchanged (basically: "{se}"-converted). Multiple paths may connect $x_1$ and $x_2$. There may be peripheral branches extending from $x_2$ which are acyclic (or cyclic) such that they contain a node which has a directed distance from $x_2$ which exceeds that of any path from $x_1$ to $x_2$; it is just the case that for any path connecting $x_1$ and $x_2$ in either direction, $x_1$ and $x_2$ are root/leaf nodes thereof. 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) in graph $x_5$, such that (in the graph $x_5$) both (A) no other node exists to which $x_2$ is connected in/by the same way/direction/relation and (B) no other node exists to which $x_1$ is connected in/by the opposite/(anti)symmetric/reversed way/direction/relation. Notes: Equivalent to "$x_1 x_2$ fo $x_4 x_5$ .{utkaro} fi $x_3$ gi'e se .utkaro fi $x_{3}^{-1}$", where $x_{3}^{-1}$ is binary relation/predicate $x_3$ with the order of its two arguments exchanged (basically: "{se}"-converted). Multiple paths may connect $x_1$ and $x_2$. There may be peripheral branches extending from $x_2$ which are acyclic (or cyclic) such that they contain a node which has a directed distance from $x_2$ which exceeds that of any path from $x_1$ to $x_2$; it is just the case that for any path connecting $x_1$ and $x_2$ in either direction, $x_1$ and $x_2$ are root/leaf nodes thereof. Jargon: Gloss Keywords: Word: path connection with two endpoints, 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) in graph $x_5$, such that (in the graph $x_5$) both (A) no other node exists to which $x_2$ is connected in/by the same way/direction/relation and (B) no other node exists to which $x_1$ is connected in/by the opposite/(anti)symmetric/reversed way/direction/relation. Notes: Equivalent to "$x_1 \, x_2$ fo $x_4 \, x_5$ .{utkaro} fi $x_3$ gi'e se .utkaro fi $x_{3}^{-1}$", where $x_{3}^{-1}$ is binary relation/predicate $x_3$ with the order of its two arguments exchanged (basically: "{se}"-converted). Multiple paths may connect $x_1$ and $x_2$. There may be peripheral branches extending from $x_2$ which are acyclic (or cyclic) such that they contain a node which has a directed distance from $x_2$ which exceeds that of any path from $x_1$ to $x_2$; it is just the case that for any path connecting $x_1$ and $x_2$ in either direction, $x_1$ and $x_2$ are root/leaf nodes thereof. Jargon: Gloss Keywords: Word: path connection with two endpoints, In Sense: Place Keywords: You can go to to see it.