It is named after Arend Heyting, who first proposed it.
In particular, the law of the excluded middle does not hold in general, though the induction axiom can be used to prove many specific cases.
For instance, one can prove that ∀ x, y ∈ N : x = y ∨ x ≠ y is a theorem (any two natural numbers are either equal to each other, or not equal to each other).
In fact, since "=" is the only predicate symbol in Heyting arithmetic, it then follows that, for any quantifier-free formula p, ∀ x, y, z, … ∈ N : p ∨ ¬p is a theorem (where x, y, z… are the free variables in p).
Kurt Gödel studied the relationship between Heyting arithmetic and Peano arithmetic.
He used the Gödel–Gentzen negative translation to prove in 1933 that if HA is consistent, then PA is also consistent.
Credits to the contents of this page go to the authors of the corresponding Wikipedia page: en.wikipedia.org/wiki/Heyting arithmetic.