 #jsDisabledContent { display:none; } My Account | Register | Help Flag as Inappropriate This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate?          Excessive Violence          Sexual Content          Political / Social Email this Article Email Address:

# Heyting arithmetic

Article Id: WHEBN0002545815
Reproduction Date:

 Title: Heyting arithmetic Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Heyting arithmetic

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

## Contents

• Introduction 1
• History 2
• Related concepts 3
• References 5

## 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, yN : x = yxy 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.

## Related concepts

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