Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Fri, 14 Apr 2023 19:42:20 -0700 Received: from [192.168.123.254] (port=34816 helo=web.lojban.org) by d58c2cd1180d with smtp (Exim 4.94.2) (envelope-from ) id 1pnVrl-002Zrg-R7 for jbovlaste-admin@lojban.org; Fri, 14 Apr 2023 19:42:20 -0700 Received: by web.lojban.org (sSMTP sendmail emulation); Sat, 15 Apr 2023 02:42:17 +0000 From: "Apache" To: lynn@foldr.moe Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utka -- By krtisfranks Date: Sat, 15 Apr 2023 02:42:17 +0000 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Message-Id: X-Spam-Score: -1.0 (-) X-Spam_score: -1.0 X-Spam_score_int: -9 X-Spam_bar: - In jbovlaste, the user krtisfranks has edited a definition of "utka" in the language "English". Differences: 5,5c5,5 < 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}". See ".{utkaro}" and ".{utkakpu}" for somewhat stronger conditions, and ".{utkaje}" for a stronger condition still. --- > 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 (thus, graph-theoretically, the edges may be directed). Neither acyclicity nor geodesicity is implied. At the level of conceptual resolution being employed in the context of its usage, $x_4$ should specify every node along at least one path from $x_1$ to $x_2$ in order and without any gaps/omissions. See also: ".{efku}", "{ki'irsi}", ".{utka'au}", "{takni}", "{taknyklojyzilpra}". See ".{utkaro}" and ".{utkakpu}" for somewhat stronger conditions, and ".{utkaje}" for a stronger condition still; see ".{utkazo}" for a weaker condition than this word (namely: allowing omissions in the path specification), and ".{utkazau}" for an alternative. Old 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}". See ".{utkaro}" and ".{utkakpu}" for somewhat stronger conditions, and ".{utkaje}" for a stronger condition still. Jargon: Gloss Keywords: Word: path-linked nodes, In Sense: 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 (thus, graph-theoretically, the edges may be directed). Neither acyclicity nor geodesicity is implied. At the level of conceptual resolution being employed in the context of its usage, $x_4$ should specify every node along at least one path from $x_1$ to $x_2$ in order and without any gaps/omissions. See also: ".{efku}", "{ki'irsi}", ".{utka'au}", "{takni}", "{taknyklojyzilpra}". See ".{utkaro}" and ".{utkakpu}" for somewhat stronger conditions, and ".{utkaje}" for a stronger condition still; see ".{utkazo}" for a weaker condition than this word (namely: allowing omissions in the path specification), and ".{utkazau}" for an alternative. Jargon: Gloss Keywords: Word: path-linked nodes, In Sense: Place Keywords: You can go to to see it.