Quantum sortal predicates
نویسندگان
چکیده
منابع مشابه
Quantum sortal predicates
Sortal predicates have been associated with a counting process, which acts as a criterion of identity for the individuals they correctly apply to. We discuss in what sense certain types of predicates suggested by quantum physics deserve the title of ‘sortal’ as well, although they do not characterize either a process of counting or a criterion of identity for the entities that fall under them. ...
متن کاملQuantum Communication Complexity of Symmetric Predicates
We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate f(x, y) depending only on |x∩y| (x, y ⊆ [n]). Namely, for a predicateD on {0, 1, . . . , n} let l0(D) def = max {l | 1 ≤ l ≤ n/2 ∧D(l) 6≡ D(l− 1)} and l1(D) def = max {n− l | n/2 ≤ l < n ∧D(l) 6≡ D(l+ 1)}. Then the bounded-error quantum communication complexity ...
متن کاملNatural Quantum Operational Semantics with Predicates
A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the ex...
متن کاملThe Sortal Theory of Plurals
This paper explores the hypothesis of a semantics for plurals with no atomic partial order defined on the domain of quantification, and thus no ontological distinction between singular and plural individuals. The idea is that the work usually done in the semantics by the atomic partial order is instead done by the syntax, which makes available to the semantics a phonologically covert sortal whi...
متن کاملCross-sortal Predication and Polysemy
This paper develops new treatment of the problem of cross-sortal predication and copredication in particular. We argue that the solution to these predicate-argument sort mismatches can be solved by a more flexible treatment of polysemy based on the notion of dependent type and dynamic construction of meaning.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2006
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-006-9127-8