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
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.
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)
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)
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.
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.
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.
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
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
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