Monotonicity in opaque verbs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity in Opaque Verbs

Neither arbitrary horses, nor intentional lions, nor generic unicorns are animals, and would-be assistents do not have to be assistents.2 In fact, one may well wonder just what sort of objects the paraphrases in (0') are supposed to be about. Given their dubious ontological status, an analysis of (0) that can do without them ought to be preferrable to one along the lines of (0') – ceteris parib...

متن کامل

Stochastic Monotonicity and Realizable Monotonicity

We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but for various large classes of S we also present conditions on the poset A that are necessary and s...

متن کامل

Opaque hemithorax

Complete opacification of a hemithorax on chest X-ray is termed opaque hemithorax (OH) and is a common finding in emergency room patients. Attending physicians encountering an OH should be able to make an immediate decision regarding the most appropriate approach. The differential diagnosis of an OH is primarily based on the volume of the affected hemithorax, as determined by the position of th...

متن کامل

Data Assurance in Opaque Computations

The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faithful to the reality they purport to represent. This paper examines that issue and systems engineering responses to it, using the chess endgame as the exemplar scenario. A structured survey has been carried out of the intri...

متن کامل

Resource-monotonicity and Population-monotonicity in Connected Cake-cutting

In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way — giving each agent a piece with a value of at least 1/n of the total. In many applications, such as dividing a land-estate or a time-interval, it is also important that the pieces are connected. We propose two additional requirements: ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linguistics and Philosophy

سال: 2007

ISSN: 0165-0157,1573-0549

DOI: 10.1007/s10988-006-9009-z