A binary relation R on a set S is transitive iff for all a, b, c ∈ S, if aRb and bRc, then aRc. This almost never applies to the relations logicians tend to think of as consequence relations; where such relations are relations on a set at all, they are rarely transitive. Yet it is common to hear consequence relations described as ‘transitive’, and to see rules imposed to ensure ‘transitivity’ o...

We compare two different ways of quantization a simple sequential game Cat’s Dilemma in the context of the debate on intransitive and transitive preferences. This kind of analysis can have essential meaning for the research on the artificial intelligence (some possibilities are discussed). Nature has both properties transitive and intransitive and maybe quantum models can be more able to captur...

This article is dedicated to soluble groups, in which pronormality is a transitive relation. Complete description of such groups is obtained.

This paper puts forward a new explanation for the development of the Austronesian voice system. I argue that both voice marking and the nominalizing function of the affixes are present already at the Proto-Austronesian stage and propose that these affixes ultimately go back to reflexive markers (which further developed into intransitive markers) and prepositions. I offer a historical explanatio...

In the framework of interaction nets 6], Yves Lafont has proved 8] that every interaction system can be simulated by a system composed of 3 symbols named , and. One may wonder if it is possible to nd a similar universal system with less symbols. In this paper, we show a way to simulate every interaction system with a speciic interaction system constituted of only 2 symbols. By transitivity, we ...