Homotopy Type Theory decidable universal quantifier > history (Rev #1)

Contents

Definition

Given a type TT, a decidable universal quantifier is a function x.()(x):(T𝟚)𝟚\forall x.(-)(x):(T \to \mathbb{2}) \to \mathbb{2} with a term

p: P:T𝟚( t:TP(t)=1)(x.P(x)=1)×(( t:TP(t)=1))(x.P(x)=0)p:\prod_{P:T \to \mathbb{2}} \left(\prod_{t:T} P(t) = 1\right) \to (\forall x.P(x) = 1) \times \left(\left(\prod_{t:T} P(t) = 1\right) \to \emptyset \right) \to (\forall x.P(x) = 0)

See also

Revision on April 27, 2022 at 16:19:30 by Anonymous?. See the history of this page for a list of all contributions to it.