Elementary function arithmetic

A weak first-order arithmetic theory whose provably total functions are the elementary recursive functions, typically extending bounded arithmetic with exponentiation.

Version

v2 · 2026-09-19 · History

Domain-specific #

4341

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Proof Theory → Mathematics

Core Idea

Elementary function arithmetic formalizes arithmetic with symbols or axioms sufficient for addition, multiplication, exponentiation, and induction restricted to bounded formulas. Bounded quantification and restricted induction permit elementary towers of fixed height while excluding stronger growth and many proofs available in Peano arithmetic. 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.

The load-bearing residual is not the broad topic of proof theory. It is the domain-specific identity determined by the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation.

How would you explain it like I'm…

 

No faithful explanation at this level. A child version turns bounded induction into 'math with only small numbers' or 'counting up to a limit', but the system allows exponentiation and fixed-height towers; its restriction is on which formulas induction may be used for, not on how big the numbers are.

Limited Domino-Proof Math

Mathematicians sometimes write down a small, strict rulebook for arithmetic to see exactly what it can prove. Elementary function arithmetic is one such rulebook: it knows about adding, multiplying, and raising to powers. It also allows proofs by 'domino' reasoning (induction), but only for statements whose searches are kept inside fixed limits. Because of that, it can handle towers of powers of a fixed height, but it cannot prove things that need faster-growing functions, which bigger rulebooks like Peano arithmetic can.

Bounded-Induction Arithmetic

Elementary function arithmetic (EFA) is a formal system of arithmetic whose language and axioms cover addition, multiplication, and exponentiation. Its induction principle is restricted to bounded formulas, ones where every 'for all' or 'there exists' ranges below some given number. This lets EFA reason about towers of exponentials of any fixed height, but blocks faster growth and many proofs that Peano arithmetic allows. To say a system really is EFA, you check that its language, exponentiation axioms, bounded-induction scheme, and the functions it can prove total all match the standard presentation. Looking similar or using similar notation is not enough.

 

Elementary function arithmetic is a weak subsystem of arithmetic studied in proof theory. Its language and axioms suffice for addition, multiplication, and exponentiation, while induction is allowed only for bounded formulas, i.e. those with quantifiers bounded by terms. The provably total functions are the elementary functions, so towers of exponentials of fixed height are available but stronger growth is excluded, along with many proofs available in Peano arithmetic. The identity of EFA is fixed by its declared presentation: language, exponentiation axioms, bounded-induction scheme, and the resulting class of provably total functions. A neighboring theory with different axioms or induction strength is not EFA, even if notation looks alike. Analysis should separate what must hold (the presentation matches), how it is established (checking each parameter and comparing with nearby theories), and what follows (consequences valid only within EFA's assumptions).

Scope of Application

Elementary function arithmetic belongs to proof theory and is useful where the analyst can specify the typed proof theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation. The scope is broad within that domain but bounded by the need for the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Elementary function arithmetic can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Elementary function arithmetic. Elementary function 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

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed proof theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of proof theory because they reuse the typed proof theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Bounded quantification and restricted induction permit elementary towers of fixed height while excluding stronger growth and many proofs available in Peano arithmetic., and type the carrier, state every parameter and convention in the definition, test that the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Elementary function arithmetic Domain-specific

Parents (1) — outgoing typed relations

• Elementary function arithmetic is a kind of Boundedness Prime

  What makes it its own entry: the domain-specific identity determined by the language, exponentiation axioms, bounded-induction scheme, and resulting elementary provably total functions match the declared EFA presentation.

Hierarchy path (1) — routes to 1 parentless root

• Elementary function arithmetic → is a kind of Boundedness

Neighborhood in Abstraction Space

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

Family — Integer & Divisor Number Theory (45 abstractions)

Nearest neighbors

• Square number — 0.90
• Bounded arithmetic — 0.89
• Geometric progression — 0.89
• Arithmetic function — 0.89
• Gauss's lemma (number theory) — 0.89

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