The class of the s-transitive (resp. w-transitive) fuzzy matrices contains properly the class of the max-min transitive fuzzy matrices for which reduction models are already known. It is shown that some basic properties of these models remain valid also for s-transitive (resp. w-transitive)fuzzy matrices.

The title of this study is the syntactic behavior second verb (V2) in Balinese serial verbs and it aims at investigating types composing analyzing V2. theory applied identifying typology by Van Staden Ger Reesink (Senft, ed., 2008), complement adjunct Kroeger (2005) used This research classified as a descriptive-qualitative study. data supporting analysis was collected from written texts short ...

We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs , one using a stored procedure to simulate a built-in transitive closure operator, one using the C language embedded with SQL statements to simulate the iterated execution of the transitive closure operation, and one u...

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...

Let PG(r, q) be the projective space of dimension r over GF (q). A k–cap K̄ in PG(r, q) is a set of k points, no three of which are collinear [10], and a k–cap is said to be complete if it is maximal with respect to set–theoretic inclusion. The maximum value of k for which there is known to exist a k–cap in PG(r, q) is denoted by m2(r, q). Some known bounds for m2(r, q) are given below. Suppose ...

Given that A is longer than B, and that B is longer than C, even 5-year-old children can infer that A is longer than C. Theories of reasoning based on formal rules of inference invoke simple axioms ("meaning postulates") to capture such transitive inferences. An alternative theory proposes instead that reasoners construct mental models of the situation described by the premises in order to draw...

An action of a group on a set is called k-transitive if it is transitive on ordered k-tuples and highly transitive if it is k-transitive for every k. We show that for n ≥ 4 the group Out(Fn) = Aut(Fn)/ Inn(Fn) admits a faithful highly transitive action on a countable set.