nLab implicative structure

Contents

Contents

Idea

An implicative structure is an ample generalization of complete Heyting algebras introduced by Alexandre Miquel in (Miquel β€˜20a).

Implicative structures are used to define implicative algebras, with are implicative structures equipped with a β€˜separator’, which generalizes a filter for an Heyting algebra. From an implicative algebra, one can then construct an implicative tripos, a construction which is the real motivation behind implicative structures and algebras.

These triposes end up generalizing many others, constructed from complete Heyting algebras, partial combinatory algebras, ordered combinatory algebras, and Krivine structures, thus unifying the methodology of realizability theory. More strikingly, Miquel proved all triposes over Set\mathbf{Set} are implicative triposes (Miquel’20b).

Definition

Definition

An implicative structure is a complete meet semilattice (π’œ,≀)(\mathcal{A}, \leq) equipped with a right-continuous monotone operation β†’:π’œ opΓ—π’œβ†’π’œ\to : \mathcal{A}^{op} \times \mathcal{A} \to \mathcal{A}.

Explicitly, this means π’œ\mathcal{A} is a poset with all meets, and β†’\to satisfies two axioms:

  1. for all a′≀a,b≀bβ€²βˆˆπ’œa' \leq a, b \leq b' \in \mathcal{A}, (aβ†’b)≀(aβ€²β†’bβ€²)(a \to b) \leq (a' \to b'),
  2. for all aβˆˆπ’œ,BβŠ†π’œa \in \mathcal{A}, B \subseteq \mathcal{A}, aβ†’β‹€ b∈Bb=β‹€ b∈B(aβ†’b)a \to \bigwedge_{b \in B} b = \bigwedge_{b \in B} (a \to b)

We don’t assume β†’\to to also be left-continuous (i.e. commute with ⋁\bigvee in the first argument, which comes out as a β‹€\bigwedge because of the antimonotonicity), though in most examples β†’\to satisfies this additional property.

Remark

Two observations follow immediately from this definition:

  1. A complete semi-lattice is, at the end of the day, the same thing as a complete lattice since ⋁A=β‹€(π’œβˆ–A)\bigvee A = \bigwedge (\mathcal{A}\setminus A), where AβŠ†π’œA \subseteq \mathcal{A}.
  2. By the adjoint functor theorem for posets, aβ†’βˆ’a \to - has a left adjoint βˆ’βŠ—a:π’œβ†’π’œ- \otimes a : \mathcal{A} \to \mathcal{A}. In this sense, implicative structures generalize Heyting algebras by weakening the requirement that βˆ’βŠ—a=βˆ’βˆ§a- \otimes a = - \wedge a. In fact, we have no requirement whatsoever on βˆ’βŠ—a- \otimes a, which makes β†’\to a much weaker operation than β‡’\Rightarrow, at least on paper.

Hence an alternative definition of implicative structure is:

Definition

An implicative structure is a complete lattice π’œ\mathcal{A} equipped with a left-continuous, monotone operation βŠ—:π’œΓ—π’œβ†’π’œ\otimes : \mathcal{A} \times \mathcal{A} \to \mathcal{A}.

In this form, it is easy to see this as broadly generalizing posetal Benabou cosmoi, more commonly known as quantales. In fact implicative structures are quantales, but for the fact that βŠ—\otimes doesn’t satisfy the axioms of a monoidal operation on π’œ\mathcal{A}.

This is interesting since cosmoi are β€˜good enrichment bases’ for categories, while implicative structures are β€˜good enrichment bases’ for sets.

See also

References

  • Alexandre Miquel, Implicative algebras: a new foundation for realizability and forcing, Mathematical Structures in Computer Science 30 (5): 458–510. (doi).
  • Alexandre Miquel. 2020. Implicative Algebras II: Completeness w.r.t. Set-Based Triposes. arXiv. https://doi.org/10.48550/arXiv.2011.09085. (arxiv)

Last revised on May 26, 2023 at 12:34:35. See the history of this page for a list of all contributions to it.