Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:44130 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.91) (envelope-from ) id 1gkAdy-0001mH-DZ for jbovlaste-admin@lojban.org; Thu, 17 Jan 2019 08:35:53 -0800 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Thu, 17 Jan 2019 08:35:50 -0800 From: "Apache" To: lynn@foldr.moe Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utka -- By krtisfranks Date: Thu, 17 Jan 2019 08:35:50 -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 "utka" in the language "English". Differences: 2,2c2,2 < $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka) via steps $x_4$ (ce'o (ordered) list) --- > $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ce'o; (ordered) list). 10a11,11 \n> Word: path-linked nodes, In Sense: Old Data: Definition: $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka) via steps $x_4$ (ce'o (ordered) list) Notes: For example, "lo stedu ku utka lo birka lo ka (ce'u ce'u) lamji" is true, with $x_4$ equal to something like "lo cnebo ce'o lo cutne ce'o lo janco". (Also: "lo stedu ku {lamji'utka} lo birka".) Formally, "utka$(A, B, P,$ [$L_1...L_n$]$)$" is equivalent to "$P(A, L_1)$ and $P(L_1, L_2)$ and ... and $P(L_{(n-1)}, L_n)$ and $P(L_n, B)$". The $x_4$ may be empty ("lo {nomei}") if there are no intermediate steps (id est: the relevant path-linking between $x_1$ and $x_2$ is direct). $x_4$ is a list of only the intermediate steps between $x_1$ and $x_2$ and does not include $x_1$ or $x_2$ themselves; it is ordered so that the relevant relation ($x_3$) holds between $x_1$ and the first term/entry of the list (in that order), between each successive pair of consecutive terms/entries of the list (in the order in which they are listed), and between the last term/entry of the list and $x_2$ (in that order). $x_4$ may not be unique. $x_3$ may not be symmetric (commutative) under exchange of its operands. The predicate may be asymmetrical. See also: ".{efku}", "{ki'irsi}", ".{utka'au}", "{takni}", "{taknyklojyzilpra}". Jargon: Gloss Keywords: Place Keywords: New Data: Definition: $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka) via intermediate steps $x_4$ (ce'o; (ordered) list). Notes: For example, "lo stedu ku utka lo birka lo ka (ce'u ce'u) lamji" is true, with $x_4$ equal to something like "lo cnebo ce'o lo cutne ce'o lo janco". (Also: "lo stedu ku {lamji'utka} lo birka".) Formally, "utka$(A, B, P,$ [$L_1...L_n$]$)$" is equivalent to "$P(A, L_1)$ and $P(L_1, L_2)$ and ... and $P(L_{(n-1)}, L_n)$ and $P(L_n, B)$". The $x_4$ may be empty ("lo {nomei}") if there are no intermediate steps (id est: the relevant path-linking between $x_1$ and $x_2$ is direct). $x_4$ is a list of only the intermediate steps between $x_1$ and $x_2$ and does not include $x_1$ or $x_2$ themselves; it is ordered so that the relevant relation ($x_3$) holds between $x_1$ and the first term/entry of the list (in that order), between each successive pair of consecutive terms/entries of the list (in the order in which they are listed), and between the last term/entry of the list and $x_2$ (in that order). $x_4$ may not be unique. $x_3$ may not be symmetric (commutative) under exchange of its operands. The predicate may be asymmetrical. See also: ".{efku}", "{ki'irsi}", ".{utka'au}", "{takni}", "{taknyklojyzilpra}". Jargon: Gloss Keywords: Word: path-linked nodes, In Sense: Place Keywords: You can go to to see it.