# Heyting arithmetic

﻿
Heyting arithmetic

In mathematical logic, Heyting arithmetic is an axiomatization of arithmetic in accordance with the philosophy of intuitionism. It is named after Arend Heyting, who first proposed it.

Heyting arithmetic adopts the axioms of Peano arithmetic, 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 $forall x,y in mathbb\left\{N\right\} : x = y vee x e 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", $forall x,y,z,... in mathbb\left\{N\right\} : p vee eg p$ is a theorem (where "x","y","z"... are the free variables in "p").

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

* Stanford Encyclopedia of Philosophy: " [http://plato.stanford.edu/entries/logic-intuitionistic/#IntNumTheHeyAri Intuitionistic Number Theory] " by Joan Moschovakis.

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Brouwer–Heyting–Kolmogorov interpretation — In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, of intuitionistic logic was proposed by L. E. J. Brouwer, Arend Heyting and independently by Andrey Kolmogorov. It is also sometimes called the… …   Wikipedia

• Arend Heyting — (May 9, 1898 ndash; July 9, 1980) was a Dutch mathematician and logician. He was a student of L.E.J. Brouwer at the Universiteit van Amsterdam, and did much to put intuitionistic logic on a footing where it could become part of mathematical logic …   Wikipedia

• Primitive recursive arithmetic — Primitive recursive arithmetic, or PRA, is a quantifier free formalization of the natural numbers. It was first proposed by Skolem [Thoralf Skolem (1923) The foundations of elementary arithmetic in Jean van Heijenoort, translator and ed. (1967)… …   Wikipedia

• Dialectica interpretation — In proof theory, the Dialectica interpretation [1] is a proof interpretation of intuitionistic arithmetic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so called System T. It was developed by Kurt Gödel… …   Wikipedia

• List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

• Intuitionism — This article is about Intuitionism in mathematics and philosophical logic. For other uses, see Ethical intuitionism. In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach to mathematics as …   Wikipedia

• Gödel–Gentzen negative translation — In proof theory, the Gödel–Gentzen negative translation is a method for embedding classical first order logic into intuitionistic first order logic. It is one of a number of double negation translations that are of importance to the metatheory of …   Wikipedia

• Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

• Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia