Skip to main content
QUICK REVIEW

[Paper Review] A comparison of minimal systems for constructive analysis

Garyfallia Vafeiadou|arXiv (Cornell University)|Aug 1, 2018
Computability, Logic, AI Algorithms16 references3 citations
TL;DR

This paper establishes that elementary analysis (EL) is strictly weaker than the minimal system of analysis (M) by identifying the axiom schema $\mathrm{CF\!_{d}}$, which asserts that every decidable predicate of natural numbers has a characteristic function. The key contribution is showing that EL + $\mathrm{CF\!_{d}}$ is equivalent to M, and that $\mathrm{CF\!_{d}}$ captures the essential difference between the two systems, resolving long-standing uncertainty about their relative strength in constructive analysis.

ABSTRACT

We establish a precise relation between M, a subsystem of the formal axiomatic system of intuitionistic analysis FIM of S. C. Kleene, and elementary analysis EL of A. S. Troelstra, two weak formal systems of two-sorted intuitionistic arithmetic, both widely used as basis for (various forms of) constructive analysis. We show that EL is weaker than M, by introducing an axiom schema CF_d asserting that every decidable predicate of natural numbers has a characteristic function. By similar arguments, we compare some more systems of two-sorted intuitionistic arithmetic, including the formal theory BIM of W. Veldman.

Motivation & Objective

  • To clarify the precise logical relationship between two foundational systems in constructive analysis: the minimal system of analysis (M) and elementary analysis (EL).
  • To identify the precise axiomatic difference between M and EL, which had been assumed equivalent but not formally established.
  • To show that EL is strictly weaker than M by isolating $\mathrm{CF\!_{d}}$ as the critical missing principle in EL.
  • To demonstrate that adding $\mathrm{CF\!_{d}}$ to EL recovers the strength of M, establishing equivalence between EL + $\mathrm{CF\!_{d}}$ and M.
  • To confirm the conservativity of M over first-order intuitionistic arithmetic and the eliminability of Church’s $\lambda$-abstraction in EL, extending prior results.

Proposed method

  • The paper introduces the axiom schema $\mathrm{CF\!_{d}}$, asserting that every decidable predicate on natural numbers has a characteristic function.
  • It proves that $\mathrm{CF\!_{d}}$ is a consequence of $\mathrm{AC_{00}!}$, the function comprehension principle in M, thereby showing EL + $\mathrm{CF\!_{d}}$ captures M’s strength.
  • It establishes that EL does not prove $\mathrm{CF\!_{d}}$, using model-theoretic and proof-theoretic techniques to show EL is strictly weaker than M.
  • It applies proof-theoretic methods, including modifications of J. Rand Moschovakis’s proof, to show the eliminability of Church’s $\lambda$-abstraction in EL.
  • It compares EL with BIM (Basic Intuitionistic Mathematics), showing they are essentially equivalent, and classifies systems by proof-theoretic strength.
  • It uses definitional extensions and conservativity arguments to analyze the logical relationships among systems like IA₁, HA₁, H, and their extensions with choice and comprehension principles.

Experimental results

Research questions

  • RQ1Is elementary analysis (EL) strictly weaker than the minimal system of analysis (M), or are they equivalent?
  • RQ2What is the precise logical principle that differentiates M from EL, and can it be isolated as an axiom schema?
  • RQ3Does adding $\mathrm{CF\!_{d}}$ to EL yield a system equivalent to M, and is $\mathrm{CF\!_{d}}$ independent of EL?
  • RQ4Can Church’s $\lambda$-abstraction be eliminated from EL, and does M conserve over first-order intuitionistic arithmetic?
  • RQ5Are BIM and EL proof-theoretically equivalent, and how do they relate to other systems like H and IA₁?

Key findings

  • EL is strictly weaker than M, as shown by the fact that EL does not prove the $\mathrm{CF\!_{d}}$ schema.
  • $\mathrm{CF\!_{d}}$ captures the essential difference between EL and M, and EL + $\mathrm{CF\!_{d}}$ is equivalent to M.
  • M is conservative over first-order intuitionistic arithmetic, confirming its foundational strength.
  • Church’s $\lambda$-abstraction can be eliminated from EL, extending a result of J. Rand Moschovakis to this system.
  • EL and BIM are essentially equivalent, and both are proof-theoretically equivalent to IA₁ + QF-AC₀₀.
  • Adding $\mathrm{CF\!_{d}}$ to any of H, IA₁, HA₁, EL, or BIM results in a strictly stronger system.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.