natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
In (modal) logic, a proposition is stable under a modality if . If is monadic?, then is stable iff for some .
(In terms of modal type theory and propositions as types this means that is a modal type.)
In intuitionistic logic, the default is the double negation modality . Since regardless, is stable iff . Being stable is weaker than being decidable; however, if every proposition is stable, then every proposition is decidable and the logic becomes classical. (This is because is decidable iff is stable.) Double negation is monadic, so by the previous paragraph, is stable iff for some ; in fact, is stable iff for some . (I guess that this has to do with negation forming a monadic adjunction with itself, or something like that.) In the topological semantics? of intuitionistic logic (where propositions correspond to open sets), the stable propositions correspond to the regular open sets.
In the internal language of a category of sheaves , a proposition is -stable iff it is enough for to hold on a dense open subset of to be able to conclude that holds on the whole of . For instance, the proposition about a section of the sheaf of real functions on is -stable.
Last revised on January 27, 2014 at 09:37:49. See the history of this page for a list of all contributions to it.