Heyting arithmetic¶

A first-order theory of natural-number arithmetic using intuitionistic rather than classical logic while retaining arithmetic axioms and induction.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4867
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Intuitionistic Logic and Foundations of Arithmetic → Mathematics

Core Idea¶

Heyting arithmetic rejects unrestricted excluded middle and double-negation elimination, admits constructive interpretations and realizability, and is equiconsistent with Peano arithmetic while differing in theoremhood and proof meaning. Natural-number terms and arithmetic axioms are combined with intuitionistic predicate-calculus rules; induction constructs propositions over numbers, and translations relate classical proofs to intuitionistic ones without identifying their inferential regimes. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Show-Me Number Math

This is math about counting numbers, but with a strict rule. You are not allowed to say 'one of these two things must be true' unless you can show which one. It is like a game where you only win by actually building the answer, not by guessing it must be there.

Prove-It-By-Building Arithmetic

Heyting arithmetic is a set of rules for proving facts about the numbers 0, 1, 2, 3 and so on. It uses the usual number facts and the step-by-step 'induction' method. But it does not allow the shortcut 'either it's true or it's false' in every case, and it does not let you drop a double 'not'. So proofs here tend to show how to actually build or find the thing. It is just as safe from contradictions as ordinary number math, but it proves different things and its proofs mean something different.

Constructive Peano Arithmetic

Heyting arithmetic is the constructive version of the usual theory of natural numbers (Peano arithmetic). It has the same number language and axioms, including induction, but reasons with intuitionistic logic. That means it rejects the general law of excluded middle (P or not-P) and the rule that 'not not P' gives P. Proofs can therefore be read constructively, for example via realizability, where a proof carries a method for producing a witness. Heyting arithmetic and Peano arithmetic are equiconsistent: one is contradiction-free exactly when the other is. Still, they differ in which statements are theorems and in what a proof means; translations link classical proofs to intuitionistic ones without making the two systems the same.

Heyting arithmetic (HA) is first-order arithmetic over the natural numbers built on intuitionistic predicate calculus rather than classical logic. Its signature includes equality, zero, successor and recursive function symbols, along with the usual arithmetic axioms and the induction schema. What distinguishes it from Peano arithmetic (PA) is the logic: unrestricted excluded middle and double-negation elimination are not available, and negation is treated as implication to falsity. This makes HA amenable to constructive interpretations such as realizability, where proofs correspond to computational witnesses. HA and PA are equiconsistent, and negative (double-negation) translations map classical proofs into intuitionistic ones. Even so, the systems differ in theoremhood and in the meaning of proof, so the translation must not be read as identifying their inferential regimes. To claim one is working in HA, the signature, rules, induction schema, treatment of negation and intended semantics should all be explicit.

Scope of Application¶

Heyting arithmetic belongs to intuitionistic logic and foundations of arithmetic and is useful where the analyst can specify the typed intuitionistic logic and foundations of arithmetic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the first-order signature, equality and recursive function symbols, intuitionistic inference rules, induction schema, treatment of falsity and negation, excluded-middle status, intended or proof-theoretic semantics, translation theorem, and comparison with Peano arithmetic are explicit. The scope is broad within that domain but bounded by the need for the first-order signature, equality and recursive function symbols, intuitionistic inference rules, induction schema, treatment of falsity and negation, excluded-middle status, intended or proof-theoretic semantics, translation theorem, and comparison with Peano arithmetic are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the first-order signature, equality and recursive function symbols, intuitionistic inference rules, induction schema, treatment of falsity and negation, excluded-middle status, intended or proof-theoretic semantics, translation theorem, and comparison with Peano arithmetic are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Heyting arithmetic. Heyting arithmetic compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed intuitionistic logic and foundations of arithmetic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of intuitionistic logic and foundations of arithmetic because they reuse the typed intuitionistic logic and foundations of arithmetic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Natural-number terms and arithmetic axioms are combined with intuitionistic predicate-calculus rules; induction constructs propositions over numbers, and translations relate classical proofs to intuitionistic ones without identifying their inferential regimes., and type the carrier, state every parameter and convention in the definition, test that the first-order signature, equality and recursive function symbols, intuitionistic inference rules, induction schema, treatment of falsity and negation, excluded-middle status, intended or proof-theoretic semantics, translation theorem, and comparison with Peano arithmetic are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Heyting arithmetic Domain-specific

Parents (1) — outgoing typed relations

Heyting arithmetic is a kind of Deductive Reasoning Prime

It remains its own entry because its identity is fixed by the first-order signature, equality and recursive function symbols, intuitionistic inference rules, induction schema, treatment of falsity and negation, excluded-middle status, intended or proof-theoretic semantics, translation theorem, and comparison with Peano arithmetic.

Hierarchy path (1) — routes to 1 parentless root

Heyting arithmetic → is a kind of Deductive Reasoning

Neighborhood in Abstraction Space¶

Heyting arithmetic sits in a crowded region of the domain-specific corpus (23^rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Formal Logic & Axiomatic Foundations (21 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25