From: "Apache" <apache@digitalkingdom.org>
To: curtis289@att.net
Reply-To: webmaster@lojban.org
Subject: [jvsw] Definition Edited At Word grafnseljimcnkipliiu -- By
 krtisfranks
Date: Thu, 2 Mar 2017 11:42:20 -0800
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Message-Id: <E1cjWcG-0004fR-Ah@stodi.digitalkingdom.org>
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 "grafnseljimcnkipliiu" in the language "English". Differences: 5,5c5,5
    < A quipyew tree graph (terminology invented by .krtisfranks.) is defined
    as follows: Define an ordered relation R on a collection of points (which
    will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric
    for any pair of points, nontransitive for any pair of ordered pairs of points
    (this requirement is guaranteed by the next condition), and generates a tree
    on the nodes (with the edges being ordered pairs of points which satisfy
   R). For any tree-generating ordered relation S: if x S y, then x is a parent
    of y and y is a child of x; if x S y and y S z, then x is an ancestor of
   z and z is a descendant of x; "x is a non-self parent of y" means that x S
    y and $x \neq y$, and likewise for the other relations just described when
    modified by the descriptor "non-self". A quipyew tree T is a directed tree
    graph generated by the reflexive closure of R, such that T is totally connected
    (in the symmetric closure of R), every node in the vertex set ($x_3$) of
   T has at most two non-self children and at most one non-self parent, and there
    exists exactly one special node $x_2$ (usually denoted "0") in the vertex
    set of T with the property that for any node n in the vertex set of T, n
   has two non-self children only if (but not necessarily if) n is a strict ancestor
    of $x_2$ according to the transitive closure of R. See also: {grafmseljimca},
    {tseingu}, {takni}. --- > Such a graph is the essence of a biological family
    tree if one selects a special individual, reduces all individuals in the
   tree accoeding to their relation to the first while ignoring gender (so, the
    various other branches are folded along the ancestral line of the selected
    individual, which is taken to be the stem, and all overlapping nodes are
   made equivalent; in other words, all non-ancestral or non-self nodes of the
    selected indivodual, are contracted via siblinghood (all siblings are counted
    the same) at the leaf and then similar contractions sequentially occur up
    the tree). A quipyew tree graph (terminology invented by [...] 
 
 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.0000]
  1.0 RDNS_DYNAMIC           Delivered to internal network by host with
                             dynamic-looking rDNS


In jbovlaste, the user krtisfranks has edited a
definition of "grafnseljimcnkipliiu" in the language "English".

Differences:

5,5c5,5
< 		A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any tree-generating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a non-self parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "non-self". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two non-self children and at most one non-self parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two non-self children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.
---
> 		Such a graph is the essence of a biological family tree if one selects a special individual, reduces all individuals in the tree accoeding to their relation to the first while ignoring gender (so, the various other branches are folded along the ancestral line of the selected individual, which is taken to be the stem, and all overlapping nodes are made equivalent; in other words, all non-ancestral or non-self nodes of the selected indivodual, are contracted via siblinghood (all siblings are counted the same) at the leaf and then similar contractions sequentially occur up the tree). A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any tree-generating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a non-self parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "non-self". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two non-self children and at most one non-self parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two non-self children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.


Old Data:

	Definition:
		$x_1$ is a 'quipyew' tree graph with special node $x_2$, on nodes $x_3$ (set of points; includes $x_2$), with edges $x_4$ (set of ordered pairs of nodes), and with other properties $x_5$.

	Notes:
		A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any tree-generating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a non-self parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "non-self". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two non-self children and at most one non-self parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two non-self children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.

	Jargon:
		

	Gloss Keywords:
		Word: quipyew tree graph, In Sense: 

	Place Keywords:


New Data:

	Definition:
		$x_1$ is a 'quipyew' tree graph with special node $x_2$, on nodes $x_3$ (set of points; includes $x_2$), with edges $x_4$ (set of ordered pairs of nodes), and with other properties $x_5$.

	Notes:
		Such a graph is the essence of a biological family tree if one selects a special individual, reduces all individuals in the tree accoeding to their relation to the first while ignoring gender (so, the various other branches are folded along the ancestral line of the selected individual, which is taken to be the stem, and all overlapping nodes are made equivalent; in other words, all non-ancestral or non-self nodes of the selected indivodual, are contracted via siblinghood (all siblings are counted the same) at the leaf and then similar contractions sequentially occur up the tree). A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become $x_3$) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any tree-generating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a non-self parent of y" means that x S y and $x \neq y$, and likewise for the other relations just described when modified by the descriptor "non-self". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set ($x_3$) of T has at most two non-self children and at most one non-self parent, and there exists exactly one special node $x_2$ (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two non-self children only if (but not necessarily if) n is a strict ancestor of $x_2$ according to the transitive closure of R. See also: {grafmseljimca}, {tseingu}, {takni}.

	Jargon:
		

	Gloss Keywords:
		Word: quipyew tree graph, In Sense: 

	Place Keywords:


You can go to <http://jbovlaste.lojban.org/dict/grafnseljimcnkipliiu> to see it.