With each proposition P we associate a set of proposition (a hyperproposition) which determines the order in which one may retreat from accepting P, if one cannot fully hold on to P. We first describe the structure of hyperpropositions. Then we describe two operations on propositions, subtraction and merge, which can be modelled in terms of hyperpropositions. Subtraction is an operation that takes away part of the content of a proposition. Merge is an operation that determines the maximal consistent content (...) of two propositions considered jointly. The merge operation gives rise to an inference relation which is, in a certain sense, optimally paraconsistent. (shrink)

How does your information change when you learn that something might be the case, where the modal “might” is epistemic? On the orthodox view, a proposition is added to your information base; on the view defended here, no propositions are added to your information base but some are removed from it. I argue that Stephen Yablo’s recent attempt to define this removal operation as a kind of propositional subtraction fails, offer a definition of my own in terms of the part–whole (...) relations between the truthmakers of the propositions one accepts, and argue that a deontic analogue of this account solves a problem about permission posed long ago by David Lewis. (shrink)