From: "Apache" <apache@digitalkingdom.org>
To: curtis289@att.net
Reply-To: webmaster@lojban.org
Subject: [jvsw] Definition Edited At Word .utkakpu -- By krtisfranks
Date: Thu, 17 Jan 2019 10:59:26 -0800
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Message-Id: <E1gkCsw-0000Us-R3@stodi.digitalkingdom.org>
X-Spam_score: -0.9
X-Spam_score_int: -8
X-Spam_bar: /


In jbovlaste, the user krtisfranks has edited a
definition of ".utkakpu" in the language "English".

Differences:

2,2c2,2
< 		$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$.
---
> 		$x_1$ and $x_2$ are path-connected by ordered binary relation/predicate $x_3$ (ka), such that all paths which satisfy condition(s) $x_4$ (ka; default: no additional conditions) in the relevant graph ($x_5$) 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$.


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). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/1IPgJM0-2DezVSiqKFuU9Bss2pPO9iimj/view?usp=drivesdk . This word is intended to be equivalent to "{utkakpu}", which accidentally has a separate entry in this dictionary.

	Jargon:
		

	Gloss Keywords:
		Word: path-connection hub, In Sense: 

	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 which satisfy condition(s) $x_4$ (ka; default: no additional conditions) in the relevant graph ($x_5$) 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", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/1IPgJM0-2DezVSiqKFuU9Bss2pPO9iimj/view?usp=drivesdk . This word is intended to be equivalent to "{utkakpu}", which accidentally has a separate entry in this dictionary.

	Jargon:
		

	Gloss Keywords:
		Word: path-connection hub, In Sense: 

	Place Keywords:


You can go to <http://jbovlaste.lojban.org/dict/.utkakpu> to see it.