Papers
Topics
Authors
Recent
Search
2000 character limit reached

Intuitionistic Mathematics and Logic

Published 4 Mar 2020 in math.LO | (2003.01935v1)

Abstract: The first seeds of mathematical intuitionism germinated in Europe over a century ago in the constructive tendencies of Borel, Baire, Lebesque, Poincar\'e, Kronecker and others. The flowering was the work of one man, Luitzen Egbertus Jan Brouwer, who taught mathematics at the University of Amsterdam from 1909 until 1951. By proving powerful theorems on topological invariants and fixed points of continuous mappings, Brouwer quickly build a mathematical reputation strong enough to support his revolutionary ideas about the nature of mathematical activity. These ideas influenced Hilbert and G\"odel and established intuitionistic logic and mathematics as subjects worthy of independent study. Our aim is to describe the development of Brouwer's intuitionism, from his rejection of the classical law of excluded middle to his controversial theory of the continuum, with fundamental consequences for logic and mathematics. We borrow Kleene's formal axiomatic systems (incorporating earlier attempts by Kolmogorov, Glivenko, Heyting and Peano) for intuitionistic logic and arithmetic as subtheories of the corresponding classical theories, and sketch his use of g\"odel numbers of recursive functions to realize sentences of intuitionistic arithmetic including a form of Church's Thesis. Finally, we present Kleene and Vesley's axiomatic treatment of Brouwer's continuum, with the function-realizability interpretation which establishes its consistency.

Summary

  • The paper introduces Brouwer's intuitionism with a focus on rejecting the law of excluded middle in favor of constructive proofs.
  • It details formal developments by Heyting, Kleene, and others, providing axiomatic foundations and realizability techniques that bridge intuitionism with computability theory.
  • The paper examines how intuitionistic approaches redefine classical concepts of analysis and continuity using dynamic and constructive methods.

Intuitionistic Mathematics and Logic

Introduction

The paper "Intuitionistic Mathematics and Logic" explores the development and implications of L.E.J. Brouwer's intuitionism in mathematics. Over a century ago, Brouwer introduced a philosophy that challenged classical mathematics, particularly the law of excluded middle, offering an alternative foundation for math and logic. This work explores Brouwer's foundational ideas and their formalization, providing insights into how intuitionistic logic diverges from its classical counterparts.

Brouwer's Early Philosophy

Brouwer's intuitionism is rooted in the rejection of the notion that mathematics is reducible to logic. He emphasized mathematics as a constructive activity, distinctly separate from the linguistic constructs of formal logic. In contrast to the logicism of his contemporaries like Russell and Whitehead, Brouwer advocated for mathematics as fundamentally dynamic, shaped by mental constructions rather than passive logical truths. This led to his critique of existing foundational systems, like Hilbert's formalism, identifying linguistic structures as inadequate to encapsulate mathematical reality.

Intuitionistic Logic

In opposition to classical logic, intuitionistic logic does not accept the law of excluded middle, especially concerning infinite sets. This form of logic emphasizes constructive proofs, where the truth of a statement is verified by a concrete example or witness rather than by an elimination of contraries. Formalization efforts by Kolmogorov, Heyting, and others provided axiomatic systems to underpin such reasoning, leading to the Brouwer-Heyting-Kolmogorov (BHK) interpretation of intuitionistic connectives.

The rigorous axiomatization of intuitionistic propositional and predicate logic showed that classical logic was a subtheory of intuitionistic logic, where classical axioms are a special case of intuitionistic ones. The interpretation of Gödel and Gentzen highlighted the possibility of embedding classical logic within intuitionistic frameworks through transformations such as the double negation.

Intuitionistic Arithmetic and Kleene's Contributions

The paper discusses Heyting's axiomatization of intuitionistic arithmetic, known as Heyting Arithmetic (HA), as distinct from Peano Arithmetic (PA). Kleene extended these notions through recursive realizability, aligning with intuitionistic arithmetic's constructive philosophy. Realizability interprets intuitionistic propositions as constructive operations, effectively bridging intuitionistic logic and computability theory. This connection underpins the consistency results and independence proofs presented within the system.

Brouwer's Continuum and Intuitionistic Analysis

Brouwer's view of the continuum diverged significantly from classical interpretations. Rather than a completed set of points, the intuitionistic continuum is a dynamic, unfinished process, characterized by free choice sequences. This notion rebuffs the classical archetype of sets, emphasizing sequences that unfold constructively over time.

Brouwer's work inspired a redefinition of continuity and other fundamental mathematical properties. For instance, he demonstrated that certain classically accepted functions, such as the characteristic function for real numbers, become undefined or discontinuous in the intuitionistic context.

Formalization and Function Realizability

Formal systems were developed to capture intuitionistic mathematics rigorously. Kleene and Vesley's system, FIM (Formal Intuitionistic Mathematics), incorporates axioms such as Bar Induction and the Continuity Principle, capturing Brouwer's informal principles into formal logic. Function realizability extends Kleene's realizability to include constructs for verifying the consistency of intuitionistic arithmetic and logic, providing a robust framework for analyzing intuitionistic propositions.

Conclusion

The paper articulates the intricate structure of intuitionistic mathematics and logic, highlighting its divergence from classical systems. Brouwer's intuitionism emphasizes a constructive paradigm, affecting the conceptualization of mathematics and fostering new developments in logic and computation. These contributions laid foundational frameworks that continue to influence areas such as computer science, particularly in type theory and formal verification. The exploration into intuitionistic principles opens pathways for future research and potential applications, challenging conventional notions of mathematical truth.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Explain it Like I'm 14

What this paper is about (in simple terms)

This paper tells the story of a different way to do math and logic, called intuitionism. It started with a mathematician named L. E. J. Brouwer. He believed that in math, you should only say something exists if you can actually build it or show how to find it. That leads to a new kind of logic (intuitionistic logic) where some rules from ordinary, “classical” logic no longer always work, especially for infinite things. The paper explains Brouwer’s ideas, shows how later logicians (like Heyting and Kleene) turned them into precise rulebooks, and then describes Brouwer’s special view of the real numbers (the “continuum”) using infinite step-by-step choices. It also shows how these ideas connect to computation and algorithms.

The big questions the paper asks

  • What does math look like if we only accept statements we can actually build or prove by giving a method?
  • If we reject the classical rule “every statement is either true or false” for some infinite problems, what rules of logic can we still safely use?
  • How can we set up arithmetic (math with whole numbers) to match this constructive viewpoint?
  • Can we connect intuitionistic proofs with algorithms, so that a proof literally tells you how to find what it claims exists?
  • How can we rebuild the real numbers (the continuum) in a constructive way that matches Brouwer’s philosophy?

How the authors approach these questions

The paper has three main strands: ideas, formal systems, and constructive models.

1) Ideas: Changing what counts as a proof

  • Classical logic uses the law of excluded middle (LEM): every statement AA is either true or not true (A∨¬AA \lor \neg A). Brouwer argued LEM is not always valid for infinite questions unless you can actually decide the statement.
  • Intuitionistic logic says: to prove “AA or BB” you must show which one holds; to prove “there exists an xx with property PP,” you must give such an xx (or a method to find one). Negation ¬A\neg A means “assuming AA leads to a contradiction,” not just “AA is false.”

Think of intuitionistic math like a “show me” rulebook: you don’t just claim something; you provide the recipe.

2) Formal systems: Clear rulebooks for constructive reasoning

  • Heyting (following Brouwer) and later Kleene wrote down precise axiom systems for intuitionistic logic (propositional and predicate logic) and for arithmetic (Heyting Arithmetic, HA).
  • These systems look like classical ones but avoid rules that assume LEM. They keep rules like “modus ponens” (from AA and A→BA \to B, conclude BB) but interpret logical symbols constructively.
  • Important bridge results show how classical proofs relate to intuitionistic ones:
    • Glivenko’s Theorem: if a propositional formula is classically provable, then its double negation is intuitionistically provable.
    • Gödel–Gentzen negative translation: you can translate classical proofs into intuitionistic ones by systematically wrapping statements in “not not” and re-expressing “or” and “exists.”

These bridges show intuitionistic logic is strong and systematic, not just “less than” classical logic.

3) Constructive models: Proofs as programs (realizability)

  • Kleene introduced “realizability,” which treats a proof of “there exists xx” as an actual number or program that computes such an xx. In other words, a proof carries an algorithm.
  • Gödel numbers are like barcodes for programs or proofs; they let you talk about “this program computes that output” inside arithmetic.
  • Church’s Thesis (informally: “effectively computable” means “computable by an algorithm”) is expressed inside arithmetic. Kleene showed that certain forms of Church’s Thesis are consistent with HA, even though they conflict with classical arithmetic when combined with LEM.

Realizability connects logic to computation: intuitionistic proofs become executable procedures.

4) Rebuilding the continuum: Choice sequences, spreads, and fans

  • Brouwer reimagined real numbers as the results of endless, step-by-step choices—like writing digits forever, not all decided in advance. These are “free choice sequences.”
  • A “spread” is like a rule-governed infinite tree: at each step, you choose a next piece following a rule (the “spread law”). The infinite paths through the tree are the “points” of the space.
  • The most general spread (the “universal spread”) corresponds to sequences of natural numbers (Baire space), which mirrors the richness of the real line.
  • A “fan” is a spread where only finitely many choices are possible at each step (like 0 or 1). The classic example is the binary fan (Cantor space). These spaces are compact and play a key role in constructive analysis.

Spreads let you model continuous things without pretending all their points are already “finished.” You only ever have a finite initial segment in hand, but you can keep refining.

Main results and why they matter

  • Intuitionistic logic and arithmetic (HA) are carefully axiomatized and understood. They retain powerful reasoning but enforce constructive meaning. That leads to special properties:
    • Existence property: if HA proves “there exists xx,” then you can extract a method to find such an xx.
    • Disjunction property: if HA proves “AA or BB,” then it can prove AA or prove BB specifically.
  • Translation theorems (Glivenko, Gödel–Gentzen) precisely relate classical and intuitionistic proofs. This shows intuitionism is not vague; it has a deep, formal relationship with classical logic.
  • Realizability ties proofs to algorithms. From a proof, you can often compute the thing the proof promises. This is central to modern ideas in computer science (like proof-as-program).
  • Certain computational principles (forms of Church’s Thesis) are consistent with HA. This is surprising: they fit intuitionistic arithmetic but clash with classical arithmetic when combined with LEM. It shows these foundational choices genuinely change what’s provable.
  • Brouwer’s constructive continuum (via choice sequences and spreads) gives a coherent, algorithm-friendly picture of real numbers and spaces. Later, Kleene and Vesley axiomatized parts of this theory and used realizability to show it’s consistent.

These results build a robust alternative foundation for math—one that aligns with computation and constructive meaning.

What this could change or influence

  • In math practice: Intuitionistic methods encourage proofs that give algorithms, not just existence claims. This is valuable in number theory, analysis, and beyond.
  • In computer science: The tight link between proofs and programs underlies proof assistants, type theory, and verified software. Intuitionistic logic is a natural fit for these tools.
  • In philosophy of math: The paper shows you can do serious mathematics without assuming every statement about infinite objects must be either true or false right now. Truth can depend on what you can construct.
  • In analysis and topology: Spreads and fans offer new, constructive ways to study continuous spaces, with results that sometimes differ from classical theorems but reveal new structure.

In short, the paper maps out how to rebuild big parts of math on a “show me the method” basis. It connects century-old ideas from Brouwer to modern logic and computation, showing that constructive thinking is both philosophically meaningful and practically powerful.

View Paper Prompt  View All Prompts 

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up