Heyting Algebra

In mathematics, a Heyting algebra, named after Arend Heyting, is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation ab of implication such that (ab)∧ab, and moreover ab is the greatest such in the sense that if cab then cab. From a logical standpoint, AB is by this definition the weakest proposition for which modus ponens, the inference rule AB, AB, is sound. Equivalently a Heyting algebra is a residuated lattice whose monoid operation ab is ab; yet another definition is as a posetal cartesian closed category with all finite sums. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations.

As lattices, Heyting algebras can be shown to be distributive. Every Boolean algebra is a Heyting algebra when ab is defined as usual as ¬ab, as is every complete distributive lattice when ab is taken to be the supremum of the set of all c for which acb. The open sets of a topological space form a complete distributive lattice and hence a Heyting algebra. In the finite case every nonempty distributive lattice, in particular every nonempty finite chain, is automatically bounded and complete and hence a Heyting algebra.

It follows from the definition that 1 ≤ 0→a, corresponding to the intuition that any proposition a is implied by a contradiction 0. Although the negation operation ¬a is not part of the definition, it is definable as a→0. The definition implies that a∧¬a = 0, making the intuitive content of ¬a the proposition that to assume a would lead to a contradiction, from which any other proposition would then follow. It can further be shown that a ≤ ¬¬a, although the converse, ¬¬aa, is not true in general, that is, double negation does not hold in general in a Heyting algebra.

Heyting algebras generalize Boolean algebras in the sense that a Heyting algebra satisfying a∨¬a = 1 (excluded middle), equivalently ¬¬a = a (double negation), is a Boolean algebra. Those elements of a Heyting algebra of the form ¬a comprise a Boolean lattice, but in general this is not a subalgebra of H (see below).

Heyting algebras serve as the algebraic models of propositional intuitionistic logic in the same way Boolean algebras model propositional classical logic. Complete Heyting algebras are a central object of study in pointless topology. The internal logic of an elementary topos is based on the Heyting algebra of subobjects of the terminal object 1 ordered by inclusion, equivalently the morphisms from 1 to the subobject classifier Ω.

Every Heyting algebra with exactly one coatom is subdirectly irreducible, whence every Heyting algebra can be made an SI by adjoining a new top. It follows that even among the finite Heyting algebras there exist infinitely many that are subdirectly irreducible, no two of which have the same equational theory. Hence no finite set of finite Heyting algebras can supply all the counterexamples to non-laws of Heyting algebra. This is in sharp contrast to Boolean algebras, whose only SI is the two-element one, which on its own therefore suffices for all counterexamples to non-laws of Boolean algebra, the basis for the simple truth table decision method. Nevertheless it is decidable whether an equation holds of all Heyting algebras.

Heyting algebras are less often called pseudo-Boolean algebras, or even Brouwer lattices, although the latter term may denote the dual definition, or have a slightly more general meaning.

Read more about Heyting Algebra:  Formal Definition, Examples, Quotients, Heyting Algebras As Applied To Intuitionistic Logic, Decision Problems

Other articles related to "heyting algebra, algebra, heyting algebras":

Subdirectly Irreducible Algebra - Applications
... A necessary and sufficient condition for a Heyting algebra to be subdirectly irreducible is for there to be a greatest element strictly below 1 ... every finite chain of two or more elements as a Heyting algebra is subdirectly irreducible ... since the quotients and subalgebras of an algebra A are never larger than A itself ...
Action Algebra - Examples
... Any Heyting algebra (and hence any Boolean algebra) is made an action algebra by taking • to be ∧ and a* = 1 ... and sufficient for star because the top element 1 of a Heyting algebra is its only reflexive element, and is transitive as well as greater or equal to every element of the algebra ... The set 2Σ* of all formal languages (sets of finite strings) over an alphabet Σ forms an action algebra with 0 as the empty set, 1 = {ε}, ∨ as union, • as concatenation, L←M as the ...
Heyting Algebra - Decision Problems
... The problem of whether a given equation holds in every Heyting algebra was shown to be decidable by S ... as hard as deciding equations of Boolean algebra (shown NP-complete in 1971 by S ... The elementary or first-order theory of Heyting algebras is undecidable ...

Famous quotes containing the word algebra: