Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Thu, 14 Jan 2021 12:07:53 -0800 Received: from [192.168.123.254] (port=60124 helo=web.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.94) (envelope-from ) id 1l081I-0090Mx-AE for jbovlaste-admin@lojban.org; Thu, 14 Jan 2021 11:10:59 -0800 Received: by web.digitalkingdom.org (sSMTP sendmail emulation); Thu, 14 Jan 2021 19:10:56 +0000 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utka'au -- By krtisfranks Date: Thu, 14 Jan 2021 19:10:55 +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 "utka'au" in the language "English". Differences: 2,2c2,2 < $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka; possibly non-symmetric/non-commutative) via a from-$x_1$-to-$x_2$-directed graph geodesic of length $x_4$ (li; nonnegative integer or positive infinity). --- > $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka; possibly non-symmetric/non-commutative) via a from-$x_1$-to-$x_2$-directed graph geodesic of length $x_4$ (li; nonnegative integer or positive infinity) in graph $x_5$ (default: maximal) which is generated by relation $x_3$. 5,5c5,5 < Respects the direction (possibly asymmetry) of the relation so that the graph geodesic distance from A to B may not equal that of from B to A (and either of them may not be defined at all or may be infinite); path-linking is as in ".{utka}". See also: ".{utka}", "{sei'au}", "{ka'au}". --- > Respects the direction (possibly asymmetry) of the relation so that the graph geodesic distance from A to B may not equal that of from B to A (and either of them may not be defined at all or may be infinite); path-linking is as in ".{utka}". If $x_5$ is a proper subgraph of the maximal graph generated by $x_3$, then $x_4$ for it will be no less than the $x_4$ value that would be attained by $x_5$ being maximal (which is the default setting); thus, changing $x_5$ allows for the specification of different valid $x_4$ values, as in "{rirny'utka'au}". See also: ".{utka}", "{sei'au}", "{ka'au}". Old Data: Definition: $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka; possibly non-symmetric/non-commutative) via a from-$x_1$-to-$x_2$-directed graph geodesic of length $x_4$ (li; nonnegative integer or positive infinity). Notes: Respects the direction (possibly asymmetry) of the relation so that the graph geodesic distance from A to B may not equal that of from B to A (and either of them may not be defined at all or may be infinite); path-linking is as in ".{utka}". See also: ".{utka}", "{sei'au}", "{ka'au}". Jargon: Gloss Keywords: Word: path-linked by n steps, In Sense: Place Keywords: New Data: Definition: $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka; possibly non-symmetric/non-commutative) via a from-$x_1$-to-$x_2$-directed graph geodesic of length $x_4$ (li; nonnegative integer or positive infinity) in graph $x_5$ (default: maximal) which is generated by relation $x_3$. Notes: Respects the direction (possibly asymmetry) of the relation so that the graph geodesic distance from A to B may not equal that of from B to A (and either of them may not be defined at all or may be infinite); path-linking is as in ".{utka}". If $x_5$ is a proper subgraph of the maximal graph generated by $x_3$, then $x_4$ for it will be no less than the $x_4$ value that would be attained by $x_5$ being maximal (which is the default setting); thus, changing $x_5$ allows for the specification of different valid $x_4$ values, as in "{rirny'utka'au}". See also: ".{utka}", "{sei'au}", "{ka'au}". Jargon: Gloss Keywords: Word: path-linked by n steps, In Sense: Place Keywords: You can go to to see it.