From: "Apache" <apache@digitalkingdom.org>
To: curtis289@att.net
Reply-To: webmaster@lojban.org
Subject: [jvsw] Definition Edited At Word rai'i -- By krtisfranks
Date: Wed, 6 Apr 2016 12:44:54 -0700
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Message-Id: <E1antNm-0006oz-BH@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 "rai'i" in the language "English". Differences: 5,5c5,5 < $X_1$ must be
    an ordered set (or an ordered structure); extremeness is measured with respect
    to the order which endows the underlying set; the output is a list of elements
    of the underlying set. $X_2$ accepts only -1 or +1; if the input to $X_2$
    is -1, then the type of extreme(ness) is lessness, so minimal elements are
    listed (starting from the least element in the underlying set according to
    its order); if the input to $X_2$ is +1, then the type of extreme(ness) is
    greatness, so maximal elements are listed (starting from the greatest element
    in the underlying set according to the order which endows it). All input
   for $X_3$ must be a nonnegative and finite integer, {ro}, or countable infinity
    ({ci'ino}); nontrivial input for $X_3$ must is a positive, finite natural
    number which is less than or equal to the cardinality of the set underlying
    $X_1$; submit "{ro}" for $X_3$ in order to reproduce the underlying set as
    an ordered list (according to the order endowing the set) only if the underlying
    set is countable (finite or infinite) and discrete (has only isolated points);
    submit 0 for $X_3$ in order to return the empty list; submit {ci'ino} in
   order to do the same as {ro}, but only if the set is countably infinite and
    is discrete (has only isolated points). If the set does not attain its supremum
    (if $X_2$ = +1) or infimum (if $X_2$ = -1), then the list is empty. Provided
    that the list is well-defined and nonempty, then the input of $X_3$ can be
    augmented by +1 only if any interval around the last element of the list
   produced with the previous value of $X_3$ which extends in the ($-X_2$)-direction
    intersected with the set underlying $X_1$ is either empty or has an ($X_2$)-determined-extreme
    element which is isolated and there exists at least one nonempty interval.
    If the set underlying $X_1$ is unbounded in the ($X_2$)-determined direction,
    then the first extreme element is $X_2 * \infty$. This operator produces
   the first $X_3$ most $X_2$-type-extreme elements of $X_1$ in order starting
    from the very most [...] 
 
 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 "rai'i" in the language "English".

Differences:

5,5c5,5
< 		$X_1$ must be an ordered set (or an ordered structure); extremeness is measured with respect to the order which endows the underlying set; the output is a list of elements of the underlying set. $X_2$ accepts only -1 or +1; if the input to $X_2$ is -1, then the type of extreme(ness) is lessness, so minimal elements are listed (starting from the least element in the underlying set according to its order); if the input to $X_2$ is +1, then the type of extreme(ness) is greatness, so maximal elements are listed (starting from the greatest element in the underlying set according to the order which endows it).  All input for $X_3$ must be a nonnegative and finite integer, {ro}, or countable infinity ({ci'ino}); nontrivial input for $X_3$ must is a positive, finite natural number which is less than or equal to the cardinality of the set underlying $X_1$; submit "{ro}" for $X_3$ in order to reproduce the underlying set as an ordered list (according to the order endowing the set) only if the underlying set is countable (finite or infinite) and discrete (has only isolated points); submit 0 for $X_3$ in order to return the empty list; submit {ci'ino} in order to do the same as {ro}, but only if the set is countably infinite and is discrete (has only isolated points). If the set does not attain its supremum (if $X_2$ = +1) or infimum (if $X_2$ = -1), then the list is empty. Provided that the list is well-defined and nonempty, then the input of $X_3$ can be augmented by +1 only if any interval around the last element of the list produced with the previous value of $X_3$ which extends in the ($-X_2$)-direction intersected with the set underlying $X_1$ is either empty or has an ($X_2$)-determined-extreme element which is isolated and there exists at least one nonempty interval. If the set underlying $X_1$ is unbounded in the ($X_2$)-determined direction, then the first extreme element is $X_2 * \infty$. This operator produces the first $X_3$ most $X_2$-type-extreme elements of $X_1$ in order starting from the very most extreme of that type.
---
> 		$X_1$ must be an ordered set (or an ordered structure); extremeness is measured with respect to the order which endows the underlying set; the output is a list of elements of the underlying set. $X_2$ accepts only -1 or +1; if the input to $X_2$ is -1, then the type of extreme(ness) is lessness, so minimal elements are listed (starting from the least element in the underlying set according to its order); if the input to $X_2$ is +1, then the type of extreme(ness) is greatness, so maximal elements are listed (starting from the greatest element in the underlying set according to the order which endows it).  All input for $X_3$ must be a nonnegative and finite integer, {ro}, or countable infinity ({ci'ino}); nontrivial input for $X_3$ must is a positive, finite natural number which is less than or equal to the cardinality of the set underlying $X_1$; submit "{ro}" for $X_3$ in order to reproduce the underlying set as an ordered list (according to the order endowing the set) only if the underlying set is countable (finite or infinite) and discrete (has only isolated points); submit 0 for $X_3$ in order to return the empty list; submit {ci'ino} in order to do the same as {ro}, but only if the set is countably infinite and is discrete (has only isolated points). If the set does not attain its supremum (if $X_2$ = +1) or infimum (if $X_2$ = -1), then the list is empty. Provided that the list is well-defined and nonempty, then the input of $X_3$ can be augmented by +1 only if any interval around the last element of the list produced with the previous value of $X_3$ which extends in the ($-X_2$)-direction intersected with the set underlying $X_1$ is either empty or has an ($X_2$)-determined-extreme element which is isolated and there exists at least one nonempty interval. If the set underlying $X_1$ is unbounded in the ($X_2$)-determined direction, then the first extreme element is $X_2 * \infty$. This operator produces the first $X_3$ most $X_2$-type-extreme elements of $X_1$ in order starting from the very most extreme of that type. The type of the output is a list, not a number; its elements must be extracted in order to be treated as numbers; this is true even if the length of the list is 1.


Old Data:

	Definition:
		mekso (2 or 3)-ary operator: maximum/minimum/extreme element; ordered list of extreme elements of the set underlying ordered set/structure $X_1$ in direction $X_2$ of list length $X_3$ (default: 1)

	Notes:
		$X_1$ must be an ordered set (or an ordered structure); extremeness is measured with respect to the order which endows the underlying set; the output is a list of elements of the underlying set. $X_2$ accepts only -1 or +1; if the input to $X_2$ is -1, then the type of extreme(ness) is lessness, so minimal elements are listed (starting from the least element in the underlying set according to its order); if the input to $X_2$ is +1, then the type of extreme(ness) is greatness, so maximal elements are listed (starting from the greatest element in the underlying set according to the order which endows it).  All input for $X_3$ must be a nonnegative and finite integer, {ro}, or countable infinity ({ci'ino}); nontrivial input for $X_3$ must is a positive, finite natural number which is less than or equal to the cardinality of the set underlying $X_1$; submit "{ro}" for $X_3$ in order to reproduce the underlying set as an ordered list (according to the order endowing the set) only if the underlying set is countable (finite or infinite) and discrete (has only isolated points); submit 0 for $X_3$ in order to return the empty list; submit {ci'ino} in order to do the same as {ro}, but only if the set is countably infinite and is discrete (has only isolated points). If the set does not attain its supremum (if $X_2$ = +1) or infimum (if $X_2$ = -1), then the list is empty. Provided that the list is well-defined and nonempty, then the input of $X_3$ can be augmented by +1 only if any interval around the last element of the list produced with the previous value of $X_3$ which extends in the ($-X_2$)-direction intersected with the set underlying $X_1$ is either empty or has an ($X_2$)-determined-extreme element which is isolated and there exists at least one nonempty interval. If the set underlying $X_1$ is unbounded in the ($X_2$)-determined direction, then the first extreme element is $X_2 * \infty$. This operator produces the first $X_3$ most $X_2$-type-extreme elements of $X_1$ in order starting from the very most extreme of that type.

	Jargon:
		

	Gloss Keywords:
		Word: maximum element, In Sense: mekso
		Word: minimum element, In Sense: mekso

	Place Keywords:


New Data:

	Definition:
		mekso (2 or 3)-ary operator: maximum/minimum/extreme element; ordered list of extreme elements of the set underlying ordered set/structure $X_1$ in direction $X_2$ of list length $X_3$ (default: 1)

	Notes:
		$X_1$ must be an ordered set (or an ordered structure); extremeness is measured with respect to the order which endows the underlying set; the output is a list of elements of the underlying set. $X_2$ accepts only -1 or +1; if the input to $X_2$ is -1, then the type of extreme(ness) is lessness, so minimal elements are listed (starting from the least element in the underlying set according to its order); if the input to $X_2$ is +1, then the type of extreme(ness) is greatness, so maximal elements are listed (starting from the greatest element in the underlying set according to the order which endows it).  All input for $X_3$ must be a nonnegative and finite integer, {ro}, or countable infinity ({ci'ino}); nontrivial input for $X_3$ must is a positive, finite natural number which is less than or equal to the cardinality of the set underlying $X_1$; submit "{ro}" for $X_3$ in order to reproduce the underlying set as an ordered list (according to the order endowing the set) only if the underlying set is countable (finite or infinite) and discrete (has only isolated points); submit 0 for $X_3$ in order to return the empty list; submit {ci'ino} in order to do the same as {ro}, but only if the set is countably infinite and is discrete (has only isolated points). If the set does not attain its supremum (if $X_2$ = +1) or infimum (if $X_2$ = -1), then the list is empty. Provided that the list is well-defined and nonempty, then the input of $X_3$ can be augmented by +1 only if any interval around the last element of the list produced with the previous value of $X_3$ which extends in the ($-X_2$)-direction intersected with the set underlying $X_1$ is either empty or has an ($X_2$)-determined-extreme element which is isolated and there exists at least one nonempty interval. If the set underlying $X_1$ is unbounded in the ($X_2$)-determined direction, then the first extreme element is $X_2 * \infty$. This operator produces the first $X_3$ most $X_2$-type-extreme elements of $X_1$ in order starting from the very most extreme of that type. The type of the output is a list, not a number; its elements must be extracted in order to be treated as numbers; this is true even if the length of the list is 1.

	Jargon:
		

	Gloss Keywords:
		Word: maximum element, In Sense: mekso
		Word: minimum element, In Sense: mekso

	Place Keywords:


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