Heyting arithmetic

In mathematical logic, Heyting arithmetic (sometimes abbreviated HA) is an axiomatization of arithmetic in accordance with the philosophy of intuitionism.[1] It is named after Arend Heyting, who first proposed it.

Introduction

Heyting arithmetic adopts the axioms of Peano arithmetic (PA), but uses intuitionistic logic as its rules of inference. 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).

History

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.

Heyting arithmetic should not be confused with Heyting algebras, which are the intuitionistic analogue of Boolean algebras.

gollark: What was the problem?
gollark: Well, that'll have to wait until I make *that* work...
gollark: I'll make a new one with the compiley whatsit.
gollark: CCEmuX hates it.
gollark: https://pastebin.com/YJDxmYi5

See also

References
  1. Troelstra 1973:18
  • Ulrich Kohlenbach (2008), Applied proof theory, Springer.
  • Anne S. Troelstra, ed. (1973), Metamathematical investigation of intuitionistic arithmetic and analysis, Springer, 1973.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.