نتایج جستجو برای: visual transitivity

تعداد نتایج: 362084  

2013
C. R. Jayanarayanan Tanmoy Paul C. R. JAYANARAYANAN

We derive transitivity of various degrees of proximinality in Banach spaces. When the transitivity does not carry forward to the bigger space we investigate these properties under some additional assumptions of the intermediate space. For instance, we show that if Z ⊆ Y ⊆ X where Z is a finite co-dimensional subspace of X which is strongly proximinal in Y and Y is an M-ideal in X then Z is stro...

2009
Graeme Forbes

In Section 1 we describe the Sorites paradox and lay out options for a solution. In Section 2 we consider approaches which deny that all premises are true, and note that these solutions all seem open to a certain serious objection. In Section 3 we note a problem for the principle of transitivity of the conditional and present a contextualist resolution of the problem, according to which the “co...

2006
Zaiwu Gong Sifeng Liu

Properties of fuzzy complementary preference relation have been studied. Based on the transformation between fuzzy complementary preference relation and reciprocal fuzzy preference relation, this paper proposes definitions of additive consistency for fuzzy complementary preference relation, gives the concepts of restricted max-min transitivity, restricted max-max transitivity and weak monotonic...

Journal: :Arch. Math. Log. 2004
Pierluigi Minari

We introduce, in a general setting, an “analytic” version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immedia...

2012
Marek Hudík

In a 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 sta...

2015
Said Broumi Irfan Deli Florentin Smarandache

In this paper, we first give the cartesian product of two neutrosophic multi sets(NMS). Then, we define relations on neutrosophic multi sets to extend the intuitionistic fuzzy multi relations to neutrosophic multi relations. The relations allows to compose two neutrosophic sets. Also, various properties like reflexivity, symmetry and transitivity are studied. AMS 03E72, 08A72 Keyword 0.1 Neutro...

2013
MICHAEL GIUDICI

Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k, L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and st(edge)-transitivity. In this paper we investigate star-transitive and st(edge)-transitive graphs by studying the structure of the vertex and edge stabilisers of suc...

2012
Samira Tasharofi Rajesh K. Karmani Steven Lauterburg Axel Legay Darko Marinov Gul A. Agha

To detect hard-to-find concurrency bugs, current tools systematically explore all possible interleavings of the transitions in a program. Unfortunately, concurrent programs have a large number of possible interleavings due to nondeterminism. Speeding up such tools requires pruning the state space explored. Partial-order reduction (POR) techniques can substantially prune the number of explored i...

1999
CHRIS STARMER

This paper tests a novel implication of the original version of prospect theory (Kahneman and Tversky, 1979): that choices may systematically violate transitivity. Some have interpreted this implication as a weakness, viewing it as an anomaly generated by the ‘editing phase’ of prospect theory which can be rendered redundant by an appropriate re-specification of the preference function. Althoug...

2015
PETE L. CLARK

Consider the following properties of a binary relation ≤ on a set X: (Reflexivity) For all x ∈ X, x ≤ x. (Anti-Symmetry) For all x, y ∈ X, if x ≤ y and y ≤ x, then x = y. (Transitivity) For all x, y, z ∈ X, if x ≤ y and y ≤ z, then x ≤ z. (Totality) For all x, y ∈ X, either x ≤ y or y ≤ x. A relation which satisfies reflexivity and transitivity is called a quasi-ordering. A relation which satis...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید