Homotopy Type Theory sigma-complete lattice > history (Rev #4, changes)

Showing changes from revision #3 to #4: Added | Removed | Changed

Contents

Definition

A σ\sigma-complete lattice is a lattice (L,,,,,)(L, \leq, \bot, \vee, \top, \wedge) with

  • a function

    n:()(n):(L)L\Vee_{n:\mathbb{N}} (-)(n): (\mathbb{N} \to L) \to L
  • a family of dependent terms

    n:,s:Li(n,s):s(n) n:s(n)n:\mathbb{N}, s:\mathbb{N} \to L \vdash i(n, s):s(n) \leq \Vee_{n:\mathbb{N}} s(n)
  • a family of dependent terms

    x: L Σ,n:,s: L Σi(n,s,x):(( n:(s(n)x))s(n)x)( n:s(n)x) x:L, x:\Sigma, n:\mathbb{N}, s:\mathbb{N} \to L \Sigma \vdash i(n, i(s, s, x):\left(\prod_{n:\mathbb{N}}(s(n) x):(s(n) \leq x) x)\right) \to \left(\Vee_{n:\mathbb{N}} s(n) \leq x\right)

representing that denumerable/countable joins exist in the lattice.

See also

References

Revision on March 12, 2022 at 05:51:49 by Anonymous?. See the history of this page for a list of all contributions to it.