In response to Block and Barnett (2012), this paper clarifies some misunderstandings about the concept of transitivity and shows its relation to rationality, asynchronicity of choice, and indifference analysis. It is demonstrated that Block and Barnett, contrary to their self-interpretation, do not in fact attack transitivity but the assumption of stable preferences. It is argued that the stabi...

Systemic Functional Linguistics provides a semiotic perspective on language. The text analysis described in Systemic Functional Linguistics (SFL) can be of critical value in real-world applications. But parsing with SFL grammars is computationally intensive task and parsers for this level of description to date have not been able to operate on unrestricted input. This paper describes a graph-ba...

In this paper we show that the widely used normalization constraint ∑ n i=1 wi = 1 does not apply to the priority vectors associated with reciprocal relations, whenever additive transitivity is involved. We show that misleading applications of this type of normalization may lead to unsatisfactory results and we give some examples from the literature. Then, we propose an alternative normalizatio...

Quantum causal histories are defined to be causal sets with Hilbert spaces attached to each event and local unitary evolution operators. The reflexivity, antisymmetry, and transitivity properties of a causal set are preserved in the quantum history as conditions on the evolution operators. A quantum causal history in which transitivity holds can be treated as “directed” topological quantum fiel...

Given a C2− Anosov diffeomorphism f:M→M, we prove that the Jacobian condition Jfn(p)=1, for every point p such fn(p)=p, implies transitivity. As application in celebrated theory of Sinai-Ruelle-Bowen, this result allows us to state classical theorem Livsic-Sinai without directly assuming transitivity as general hypothesis. A special consequence our is C2-Anosov diffeomorphism, which regular, in...

This paper is a step towards a systematic theory of the transitivity (clustering) phenomenon in random networks. A static framework is used, with adjacency matrix playing the role of the dynamical variable. Hence, our model is a matrix model, where matrices are random, but their elements take values 0 and 1 only. Confusion present in some papers where earlier attempts to incorporate transitivit...

The last few years have seen a number of new and important publications in moral theory. Arguably none more important than Larry S. Temkin’s Rethinking the Good: Moral Ideals and the Nature of Practical Reasoning. This fascinating work highlights and explores in depth a seemingly fundamental inconsistency in our own axiological beliefs. Put roughly, the inconsistency arises given our general wi...

It is widely assumed that causation is transitive, but putative counterexamples abound. These examples come in three varieties: switching cases, short circuit cases, and what I will call mismatch cases. In this paper I focus on the mismatch variety, which is widely taken to be the easiest to resolve. I will first introduce the cases and the existing strategy for dealing with them, then present ...

We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set D ⊂ E and require that a valid solution A satisfies D ⊂ A (it is sometimes called transitive reduction problem). In the second extension (called p-ary trans...

We show that intra-sentential binding constraints can act as global constraints that via transitivity enforce consistency on coreference sets. This yields about 5 % increase in performance. In our model, the probabilities of a baseline classi er for coreference resolution are used as weights in an optimization model. The underlying integer linear programming (ILP) speci cation is straightforwar...