pith. sign in

arxiv: quant-ph/9810090 · v1 · submitted 1998-10-29 · 🪐 quant-ph

Opaque predicates, veiled sets and their logic

classification 🪐 quant-ph
keywords predicatesopaquecallcaseextensionsindeterminacylogicobject
0
0 comments X
read the original abstract

Motivated by considerations in the foundations of quantum mechanics and inspired by the literature on vague predicates, we introduce the concept of an opaque predicate. While in the case of vague predicates there is a kind of indeterminacy with respect to the predicate, in the sense that the vagueness concerns whether a well-determined object satisfies it or not, in the case of opaque predicates the indeterminacy is with regard to the objects which should satisfy them. In other words, their extensions are not well-defined, despite the fact that the conditions for an object to satisfy the predicates are well-known. We suggest that such opaque predicates (and more generally, what we call opaque relations) can be characterized by a logic which encompasses a semantics founded in quasi-set theory, and call their extensions veiled sets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.