Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:49224 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.91) (envelope-from ) id 1gkB1W-0002l3-Kx for jbovlaste-admin@lojban.org; Thu, 17 Jan 2019 09:00:14 -0800 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Thu, 17 Jan 2019 09:00:10 -0800 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word .utkakpu -- By krtisfranks Date: Thu, 17 Jan 2019 09:00:10 -0800 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Message-Id: X-Spam-Score: 0.5 (/) X-Spam_score: 0.5 X-Spam_score_int: 5 X-Spam_bar: / X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has edited a definition of ".utkakpu" in the language "English". Differences: 5,5c5,5 < All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the cas [...] Content analysis details: (0.5 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] -0.5 BAYES_05 BODY: Bayes spam probability is 1 to 5% [score: 0.0129] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has edited a definition of ".utkakpu" in the language "English". Differences: 5,5c5,5 < All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). --- > All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome". Old Data: Definition: $x_1$ and $x_2$ are path-connected by ordered binary relation/predicate $x_3$ (ka), such that all paths in the relevant graph ($x_4$) linking nodes by said relation $x_3$ in a directed manner and which contain $x_1$ must also (later in the path) contain $x_2$. Notes: All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). Jargon: Gloss Keywords: Place Keywords: New Data: Definition: $x_1$ and $x_2$ are path-connected by ordered binary relation/predicate $x_3$ (ka), such that all paths in the relevant graph ($x_4$) linking nodes by said relation $x_3$ in a directed manner and which contain $x_1$ must also (later in the path) contain $x_2$. Notes: All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome". Jargon: Gloss Keywords: Place Keywords: You can go to to see it.