Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:41252 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.86) (envelope-from ) id 1amcoz-0001ze-2M for jbovlaste-admin@lojban.org; Sun, 03 Apr 2016 00:51:50 -0700 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Sun, 03 Apr 2016 00:51:44 -0700 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word tseingu -- By krtisfranks Date: Sun, 3 Apr 2016 00:51:44 -0700 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Message-Id: X-Spam-Score: 0.5 (/) X-Spam_score: 0.5 X-Spam_score_int: 5 X-Spam_bar: / X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has edited a definition of "tseingu" in the language "English". Differences: 5,5c5,5 < This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. --- > While technically not good, this definition also employs the convention that $x_3$ is positive (countable) infinity if $A$ does not exist, meaning that $x_1$ and $x_2$ belong to disjoint trees (or if one of them is undefined); in this case, $x_4$ is not well-defined (see: "{zi'au}"). This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the [...] Content analysis details: (0.5 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] 1.4 RCVD_IN_BRBL_LASTEXT RBL: No description available. [173.13.139.235 listed in bb.barracudacentral.org] -1.9 BAYES_00 BODY: Bayes spam probability is 0 to 1% [score: 0.0003] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has edited a definition of "tseingu" in the language "English". Differences: 5,5c5,5 < This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. --- > While technically not good, this definition also employs the convention that $x_3$ is positive (countable) infinity if $A$ does not exist, meaning that $x_1$ and $x_2$ belong to disjoint trees (or if one of them is undefined); in this case, $x_4$ is not well-defined (see: "{zi'au}"). This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. Old Data: Definition: $x_1$ (node in a tree graph) and $x_2$ (node in the same tree graph) have an essentially unique most recent (graph-nearest) common ancestor node A such that $x_3$ [nonnegative integer; li] is the minimum element of the set consisting only of $d($A$, x_1)$ and of $d($A$, x_2)$, and such that $x_4$ [integer; li] is $d($A$, x_1) - d($A$, x_2)$, where $d$ is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction). Notes: This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. Jargon: Gloss Keywords: Word: consanguinity values, In Sense: Word: cousin degree, In Sense: Word: cousin order, In Sense: ordinal of cousin relationship Word: cousin removal, In Sense: Word: degree of removal, In Sense: cousin relationship Word: kinship number, In Sense: Place Keywords: New Data: Definition: $x_1$ (node in a tree graph) and $x_2$ (node in the same tree graph) have an essentially unique most recent (graph-nearest) common ancestor node A such that $x_3$ [nonnegative integer; li] is the minimum element of the set consisting only of $d($A$, x_1)$ and of $d($A$, x_2)$, and such that $x_4$ [integer; li] is $d($A$, x_1) - d($A$, x_2)$, where $d$ is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction). Notes: While technically not good, this definition also employs the convention that $x_3$ is positive (countable) infinity if $A$ does not exist, meaning that $x_1$ and $x_2$ belong to disjoint trees (or if one of them is undefined); in this case, $x_4$ is not well-defined (see: "{zi'au}"). This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-specified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. Jargon: Gloss Keywords: Word: consanguinity values, In Sense: Word: cousin degree, In Sense: Word: cousin order, In Sense: ordinal of cousin relationship Word: cousin removal, In Sense: Word: degree of removal, In Sense: cousin relationship Word: kinship number, In Sense: Place Keywords: You can go to to see it.