nLab stable proposition



Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logiccategory theorytype theory
trueterminal object/(-2)-truncated objecth-level 0-type/unit type
falseinitial objectempty type
proposition(-1)-truncated objecth-proposition, mere proposition
proofgeneralized elementprogram
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
cut elimination for implicationcounit for hom-tensor adjunctionbeta reduction
introduction rule for implicationunit for hom-tensor adjunctioneta conversion
logical conjunctionproductproduct type
disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)
implicationinternal homfunction type
negationinternal hom into initial objectfunction type into empty type
universal quantificationdependent productdependent product type
existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)
equivalencepath space objectidentity type/path type
equivalence classquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
completely presented setdiscrete object/0-truncated objecth-level 2-type/set/h-set
setinternal 0-groupoidBishop set/setoid
universeobject classifiertype of types
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels


Modalities, Closure and Reflection



In (modal) logic, a proposition pp is stable under a modality \diamond if ppp \equiv \diamond{p}. If \diamond is monadic?, then pp is stable iff pqp \equiv \diamond{q} for some qq.

(In terms of modal type theory and propositions as types this means that pp is a modal type.)


In intuitionistic logic, the default is the double negation modality ¬¬\neg\neg. Since p¬¬pp \Rightarrow \neg\neg{p} regardless, pp is stable iff ¬¬pp\neg\neg{p} \Rightarrow p. 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 pp is decidable iff p¬pp \vee \neg{p} is stable.) Double negation is monadic, so by the previous paragraph, pp is stable iff p¬¬qp \equiv \neg\neg{q} for some qq; in fact, pp is stable iff p¬qp \equiv \neg{q} for some qq. (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 Sh(X)Sh(X), a proposition pp is ¬¬\neg\neg-stable iff it is enough for pp to hold on a dense open subset of XX to be able to conclude that pp holds on the whole of XX. For instance, the proposition f=0f = 0 about a section ff of the sheaf of real functions on XX is ¬¬\neg\neg-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.