A family of fuzzification schemes is proposed that can be used to transform cardinality-based similarity measures for ordinary sets into similarity measures for fuzzy sets in a finite universe. These schemes are based on the Frank t-norm family and preserve transitivity in the fuzzification process.

the value of good X (x-axis) and such that the response is menu dependent (red when X is offered against Y, blue when X is offered against Z). Transitivity violations (i.e., cases where x-axis orderings are not conserved on the y-axis) are possible, as for X1, X2, X3. However, if the representation is menu invariant (i.e., if red and blue lines coincide), transitivity violations cannot occur. I...

This paper investigates the effect of network structure properties on the outcome of a well researched information dissemination mechanism. Using a computer simulation, the impact of network transitivity, centralization and density on both process variables and final outcomes are tested. The key finding of this simulation include a process model where the network structure properties only influ...

The purpose of the present study is to use transitivity analysis investigate gender variations in political media discourse from point view male and female columnists. To attain this purpose, paper adopts a critical (CDA) Halliday’s theory process types. Literature shows that variation one key elements affecting language. However, studies, particularly article writing, has not been recently add...

nonnative english-speaking scholars have often been reported to be at a disadvantage vis-à-vis their english native counterparts when it comes to writing a publishable research article (ra). when they submit their manuscripts to english-language journals, they sometimes receive comments criticizing their faulty english. one area of difficulty for these authors is the grammaticalization of neutr...

We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or st...

A distributional model of the relation between judgments on transitivity tasks and memory for premise comparisons is proposed, according to which a total population of children solving a transitivity task can be divided into two subpopulations: (a) The operational subpopulation consists of all children who infer their transitivity judgments (e.g., stick A is longer than stick C) from a composit...

This paper investigated children's ability to use syntactic structures to infer semantic information. The particular syntax-semantics link examined was the one between transitivity (transitive/intransitive structures) and telicity (telic/atelic perspectives; that is, boundedness). Although transitivity is an important syntactic reflex of telicity, it is neither necessary nor sufficient for pred...

Abstract As is well known, implication transitive but probabilistic support not. Eells and Sober, followed by Shogenji, showed that screening off a sufficient constraint for the transitivity of support. Moreover, this condition can be weakened without sacrificing transitivity, as was demonstrated Suppes later Roche. In paper we introduce an even weaker support, in fact one made weak wishes. We ...