ce'u KOhA8 cmavo

pseudo-quantifier binding a variable within an abstraction that represents an open place.

On affix form:

cecmu
x1 is a community/colony of organisms x2.

In definition:

li'i ze'ei ka (comp!)
abstractor: experience of being: x1 is x2's experience of being [bridi] (property of x2; with {ce'u} referring to x2's position)
cimny'efku
x1 is infinitely recursively related to x2 by applying infinite levels of recursion to predicate relation x3 (ka with two ce'u)
dzoli
x1 is recursively related to x2 by applying x3 (number) levels-of-recursion of the predicate-relation x4 (ka with two ce'u)
ga'ei (exp!)
abstractor: sensation / qualia abstractor; x1 is the sensation / qualia associated with objects with property [bridi, bound to ce'u], via sense x2, as sensed by x3
kai'i
Property relativizing determiner / unary quantifier constructor. {kai'i} introduces a predicate whose first argument slot becomes filled by the property made by taking the bridi in which this {kai'i} appears and putting {ce'u} into the argument slot in which this {kai'i} argument was located. Put formally, "kai'i brodi cu brodu" = "lo ka ce'u brodu cu brodi". Additionally, a {kai'i} term has a rightward logical scope, like quantifiers and adverbials.
kai'u (exp!)
abstractor: x1 (x2, ...) are such that they satisfy [bridi], binding to the open {ce'u} slots.
ka'oi'i (exp!)
convert bridi into n-ary property claim: xn is such that it fills the n-th occurrence of ce'u in [bridi].
mau'a
shortening of {lo du'u ma kau *bridi*}, with {ce'u} bound to {ma kau}
me'ei
Article for abstract predicate sumti. Turns a selbri into an abstraction with all open places filled by {ce'u}.
efku
x1 is recursively related to x2 by applying x3 (number) levels-of-recursion of the predicate-relation x4 (ka with two ce'u)
enka
x1 (terbricmi) is bound to x2 (sumti) by relationship x3 (relationship with two {ce'u} for x1 and x2)
inbri
x1 (proposition) is a clause expressing adverbial relation x2 (property of nonce place, has places for ce'u referring to members of x3) and connecting members of x3 (ordered group)
kanmige
x1 (property with two places for ce'u) is the property according to which members of x2 (ordered set with two members) are related to each other in the same way as members of x3 (ordered set with two members), or in the same way as members of x4 (ordered set with two members), etc. ... (infinite number of places)
refkusi
x1 is recursively related to x2 by applying x3 (number) levels-of-recursion of the predicate-relation x4 (ka with two ce'u)

In notes:

kamckire
x1=k1 is the property of gratitude/thankfulness/appreciation of x2=c2 for x3=c3 (event/property)
kamdu'o
x1 is the identity function/equality relation
mitysisku
x1 seeks/searches/looks for something that has the same identity as x2 among x3
selbri
x1 (ka) is the relation of predicate x2 (du'u), which has arguments x3 (sequence of sumti).
terbri
x1 (sequence of sumti) is the sequence of arguments that, joined by relation x2 (ka), form predicate x3 (du'u)
zvasisku
x1=s1 looks for the location of x2=z1 among location(s) x3=s3=z2
clenu
x1 is an axis/center curve/extended center (or, possibly metaphorically, focus 'point') of x2 in sense x3
facni
x1 is an n-ary operator/map which is distributive/linear/homomorphic in or over or from space/structure x2, mapping to space or structure x3, thereby producing a new space/structure x4 which is the 'union' of x2 and x3 endowed with x1; x1 distributes over/through all of the operators of x2.
ce'ai (exp!)
lambda variable prenex; marks the end of introduction of lambda-scope variables.
cei'e
define following selbri with sentence or tu'e...tu'u clause
fo'ai
Creates a predicate abstraction sumti out of a full bridi clause, binding all the necessary lambda variables to the ko'a-ko'u pronoun series. The number of bound variables must be indicated by appending {xi} followed by that number to the word {fo'ai}, unless only one variable (namely {fo'a}) is bound, in which case the {xi} marking is optional.
ka'ei (exp!)
abstractor: predicate abstractor. x1 is the predicate expressed by [bridi], using bo'a, bo'e, etc for variables.
kai'ei (exp!)
abstractor: x1 (x2, ...) are such that they satisfy [bridi], using bo'a/bo'e/etc for variables
ka'oi (exp!)
x1 (ka) is obtained from x2 (ka) by uncurrying the first N places
kau'u
Predicate to variable-binding binary quantifier. The first slot of the predicate must be a property.
ke'au (exp!)
relative clause prenex: assigns a variable to the object of the relative clause
ko'ai
Creates a predicate abstraction sumti out of a full bridi clause, binding all the necessary lambda variables to the ko'a-ko'u pronoun series.
sei'au
terbri editor: passes the terbri value through the quoted function so that the sumti that fills it really is filling the output of the function
xe'u (exp!)
Abstraction variable indicator selbrisle.
ctu'au
x1 is involved in predicate x2; the latter being true of some argument structure syntactically entails something about the former.
djeisone
x1 is an object described as x2, x3, ... (termset representing serializable tree structure compatible with JSON format of attribute-value pairs).
dunliki
Something is such that both x1 and x2 are related to it by predicate x3. x4 [quantifier] thing to which x1 is related by predicate x3 is such that x2 is related to it by predicate x3.
funtiio
x1 (plural of ordered pairs) is an exhaustive set (possibly infinite) of inputs/outputs defining a unary function which yields result x3 when given input x2; x1(x2) = x3
ganseti
x1 is the sensation/qualia (abstract) associated with objects with property x2 (ka), via sense x3 (ka), as sensed by x4
kamcedu
x1 (ka) is the property/state of being x2
ki'inmoi
x1 is in relation x4 with x2 to the x3th degree; x1 is x3 nodes before x2 in the sequence such that every element thereof and the next element are linked by the relation x4; x1 is [ that which is in relation x4 with ] (repeat x3 times the part between brackets) x2
ki'irsi
x1 is a sequence in which each adjacent pair of elements is related by x2 (binary predicate; applied in the order of the sequence).
kinjazu
x1 does x2 (ka/nu) to show that they satisfy binary property x3 (ka) with/to audience x4.
kompeti
x1 (group of entity) compete with each other in competition x2 (property of each member of x1) where each member of x1 has goal x3 (property of member of x1) that is the same for all members of x1
ko'orsi
x1 (ka, binary predicate) links x2 and x3, and x3 and x4, and x4 and x5, et cetera
lamji'utka
x1 is directly or indirectly touching x2 via intermediate steps x3 (ce'o list); x1 and x2 belong to the same connected component.
utka
x1 and x2 are path-linked by binary predicate x3 (ka) via intermediate steps x4 (ce'o; (ordered) list).
ziltodi
x1 is a property of a constant number/amount