Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Gregory Wheeler (2007). Two Puzzles Concerning Measures of Uncertainty and the Positive Boolean Connectives. In Gregory Wheeler (ed.), Progress in Artificial Intelligence (EPIA 2007). Springer.
Similar books and articles
We consider countably additive, nonnegative, extended real-valued measures which vanish on singletons. Such a measure is universal on a set X iff it is defined on all subsets of X and is semiregular iff every set of positive measure contains a subset of positive finite measure. We study the problem of existence of a universal semiregular measure on X which is invariant under a given group of bijections of X. Moreover we discuss some properties of universal, semiregular, invariant measures on groups.
A coherent account of the connections and contrasts between the principles of complementarity and uncertainty is developed starting from a survey of the various formalizations of these principles. The conceptual analysis is illustrated by means of a set of experimental schemes based on Mach-Zehnder interferometry. In particular, path detection via entanglement with a probe system and (quantitative) quantum erasure are exhibited to constitute instances of joint unsharp measurements of complementary pairs of physical quantities, path and interference observables. The analysis uses the representation of observables as positive-operator-valued measures (POVMs). The reconciliation of complementary experimental options in the sense of simultaneous unsharp preparations and measurements is expressed in terms of uncertainty relations of different kinds. The feature of complementarity, manifest in the present examples in the mutual exclusivity of path detection and interference observation, is recovered as a limit case from the appropriate uncertainty relation. It is noted that the complementarity and uncertainty principles are neither completely logically independent nor logical consequences of one another. Since entanglement is an instance of the uncertainty of quantum properties (of compound systems), it is moot to play out uncertainty and entanglement against each other as possible mechanisms enforcing complementarity.
In the tradition of substructural logics, it has been claimed for a long time that conjunction and inclusive disjunction are ambiguous:we should, in fact, distinguish between ‘lattice’ connectives (also called additive or extensional) and ‘group’ connectives (also called multiplicative or intensional). We argue that an analogous ambiguity affects the quantifiers. Moreover, we show how such a perspective could yield solutions for two well-known logical puzzles: McGee’s counterexample to modus ponens and the lottery paradox.
We address the classification of the possible finitely-additive probability measures on the Boolean algebra of definable subsets of M which are invariant under the natural action of $\operatorname{Aut}(M)$ . This pursuit requires a generalization of Shelah's forking formulas [8] to "essentially measure zero" sets and an application of Myer's "rank diagram" [5] of the Boolean algebra under consideration. The classification is completed for a large class of ℵ 0 -categorical structures without the independence property including those which are stable.
Two types of measures of probabilistic uncertainty are introduced and investigated. Dispersion measures report how diffused the agent’s second-order probability distribution is over the range of first-order probabilities. Robustness measures reflect the extent to which the agent’s assessment of the prior (objective) probability of an event is perturbed by information about whether or not the event actually took place. The properties of both types of measures are investigated. The most obvious type of robustness measure is shown to coincide with one of the major candidates for a dispersion measure, the mean square deviation measure.
Chang's MV algebras are the algebras of the infinite-valued sentential calculus of ukasiewicz. We introduce finitely additive measures (called states) on MV algebras with the intent of capturing the notion of average degree of truth of a proposition. Since Boolean algebras coincide with idempotent MV algebras, states yield a generalization of finitely additive measures. Since MV algebras stand to Boolean algebras as AFC*-algebras stand to commutative AFC*-algebras, states are naturally related to noncommutativeC*-algebraic measures.
Scientific uncertainty puzzles many people. The puzzlement arises when scientists have more than one answer, and disagree among themselves. This book helps people find their way through this maze of scientific contradiction and uncertainty. By acquainting them with the ways that uncertainty arises in science, how scientists accommodate and make use of uncertainty, and how they reach conclusions in the face of uncertainty, the book enables readers to confidently evaluate uncertainty from their own perspectives, in terms of their own experiences.
We illustrate, with three examples, the interaction between boolean and modal connectives by looking at the role of truth-functional reasoning in the provision of completeness proofs for normal modal logics. The first example (§ 1) is of a logic (more accurately: range of logics) which is incomplete in the sense of being determined by no class of Kripke frames, where the incompleteness is entirely due to the lack of boolean negation amongst the underlying non-modal connectives. The second example (§ 2) focusses on the breakdown, in the absence of boolean disjunction, of the usual canonical model argument for the logic of dense Kripke frames, though a proof of incompleteness with respect to the Kripke semantics is not offered. An alternative semantic account is developed, in terms of which a completeness proof can be given, and this is used (§ 3) in the discussion of the third example, a bimodal logic which is, as with the first example, provably incomplete in terms of the Kripke semantics, the incompleteness being due to the lack of disjunction (as a primitive or defined boolean connective).
It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual ...
Discussion of Gregory Wheeler, Two puzzles concerning measures of uncertainty and the positive Boolean connectives
|
|
There are no threads in this forum |
Nothing in this forum yet.

