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

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

Journal: :Order 2014
Alfio Giarlotta

A NaP-preference (necessary and possible preference) on a set A is a pair ( , P ) of binary relations on A such that its necessary component N is a partial preorder, its possible component P is a completion of , and the two components jointly satisfy natural forms of mixed completeness and mixed transitivity. We study additional mixed transitivity properties of a NaP-preference ( , P ) , which ...

Journal: : 2022

Türkçede geçişlilik her ne kadar anlamsal bir olgu olarak tanımlansa da çoğunlukla katı söz dizimsel ölçüte, yani en az iki üyeli fiillerin cümlede sadece yükleme durumunda Nesne almasına bağlanmıştır. Geçişliliğin farklı yapı ya durum çerçeveleriyle kodlanabileceği göz ardı edilmiş ve tek tip tasarlanmıştır. Ancak geçişliliğin dereceleri vardır fiilleri ölçüte dayanarak geçişli geçişsiz diye k...

1999
Michael H. Birnbaum Melissa K. Lott

This study tests between two modern theories of decision making. Rankand sign-dependent utility (RSDU) models, including cumulative prospect theory (CPT), imply stochastic dominance and two cumulative independence conditions. Configural weight models, with parameters estimated in previous research, predict systematic violations of these properties for certain choices. Experimental data systemat...

Journal: :Social Choice and Welfare 2011
Conal Duddy Juan Perote-Peña Ashley Piggins

In the literature on social choice with fuzzy preferences, a central question is how to represent the transitivity of a fuzzy binary relation. Arguably the most general way of doing this is to assume a form of transitivity called max-star transitivity. The star operator in this formulation is commonly taken to be a triangular norm. The familiar max-min transitivity condition is a member of this...

2017
Jiaqing Liang Yi Zhang Yanghua Xiao Haixun Wang Wei Wang Pinpin Zhu

Taxonomy is indispensable in understanding natural language. A variety of large scale, usage-based, data-driven lexical taxonomies have been constructed in recent years. Hypernym-hyponym relationship, which is considered as the backbone of lexical taxonomies can not only be used to categorize the data but also enables generalization. In particular, we focus on one of the most prominent properti...

2012
Hui-chuan Wang

L1 transfer is generally regarded as an important characteristic of L2 acquisition, also one of the sources of learners’ errors. One of the primary transfer between English and Chinese lies in the verb usage since verbs that are transitive in Chinese may be intransitive in English, or vice versa. In the previous studies, the investigation on the syntactic transfer in verb transitivity is only o...

2014
Italo J. Dejter

A 1-factorization F1 of the complement Σ7 of the perfect Hamming code in the 7cube graphQ7 is given explicitly. For i = 2, 3, the component 1-factors ofF1 can be reunited to form i-factorizations Fi of Σ7 for which the component i-factors are pairwise isomorphic. The smallest connected factors that can be obtained as edge-subset unions from factors of these two factorizations show differing tra...

Journal: :Advances in Mathematics 2021

We prove several results on the behavior of Kim-independence upon changing base in NSOP1 theories. As a consequence, we that satisfies transitivity and this characterizes NSOP1. Moreover, characterize witnesses to Kim-dividing as exactly -Morley sequences. give applications, answering number open questions concerning transitivity, Morley sequences, local character

2017
Walter Bossert

This paper provides a brief introduction to the use and usefulness of Suzumura consistency, a coherence requirement for binary relations that weakens transitivity. The property is introduced by Suzumura (1976b) in the context of collective choice but, as demonstrated in some recent contributions, its applicability reaches beyond the boundaries of social-choice theory. In addition to a summary o...

2004
Jean-Paul Doignon Jean-Claude Falmagne

A transitivity part of a relation on a set X is any subset of X on which the restriction of the relation is transitive. What can be recovered of a relation from the sole knowledge of its transitivity parts? In general, the relation itself cannot be recovered, because it has the same transitivity parts as its converse. In certain situations, the unordered pair formed by the relation and its conv...

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

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