Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Thu, 14 Jan 2021 12:08:46 -0800 Received: from [192.168.123.254] (port=47030 helo=web.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.94) (envelope-from ) id 1l08vD-009Rqf-GG for jbovlaste-admin@lojban.org; Thu, 14 Jan 2021 12:08:46 -0800 Received: by web.digitalkingdom.org (sSMTP sendmail emulation); Thu, 14 Jan 2021 20:08:43 +0000 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Added At Word utkamtau -- By krtisfranks Date: Thu, 14 Jan 2021 20:08:43 +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 added a definition of "utkamtau" in the language "English". New Data: Definition: $x_1$ and $x_2$ are path-linked by binary predicate $x_3$ (ka; possibly non-symmetric/non-commutative) via some from-$x_1$-to-$x_2$-directed path of length $x_4$ (li; nonnegative integer or positive infinity) in/through graph $x_5$ (default: maximal) which is generated by relation $x_3$. Notes: Like ".{utka'au}" but primarily without the constraint that a geodesic path be chosen. The requirement simply is that there exists at least one path from $x_1$ to $x_2$ via steps related by $x_3$ in $x_5$ such that the path has total length $x_4$. Notice that this does not interact well if the directed graph is connected to at least one cycle. Otherwise, as appropriate, this word and all of its notes are equivalent to those of ".utka'au". Jargon: Gloss Keywords: Word: path-linked by n steps, In Sense: Place Keywords: You can go to to see it.