Completeness theorems via the double dual functor (Q1970592)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1420236
Language Label Description Also known as
default for all languages
No label defined
    English
    Completeness theorems via the double dual functor
    scientific article; zbMATH DE number 1420236

      Statements

      Completeness theorems via the double dual functor (English)
      0 references
      0 references
      0 references
      0 references
      14 November 2000
      0 references
      The `duality' implicitly referred to in the title is the dual adjunction between bounded distributive lattices and partially ordered sets, induced by the schizophrenic object \(2\); that is, the double dual of a distributive lattice \(L\) is the lattice of upper sets in its poset of prime filters. The latter is always a complete bi-Heyting algebra (indeed, it is completely distributive, though the authors do not mention this), and the authors regard it as a kind of completion of \(L\), even though the construction is not idempotent. Their key observation is that the canonical embedding of \(L\) in its double dual is conditionally bi-Heyting (that is, it preserves any implications and differences which exist); by exploiting this fact, and by specializing to particular classes of lattices, they obtain a number of completeness and conservativity results for various nonclassical and modal logics.
      0 references
      modal logics
      0 references
      dual adjunction
      0 references
      bounded distributive lattices
      0 references
      partially ordered sets
      0 references
      bi-Heyting algebra
      0 references
      canonical embedding
      0 references
      completeness
      0 references
      conservativity
      0 references
      nonclassical logics
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references