### Abstract

In this formalization, we develop an implementation of the Goodstein function G in plain λ-calculus, linked to a concise, self-contained specification. The implementation works on a Church-encoded representation of countable ordinals. The initial conversion to hereditary base 2 is not covered, but the material is sufficient to compute the particular value G(16), and easily extends to other fixed arguments.

### License

BSD License

### Topics

- Logic/Rewriting

### Session Goodstein_Lambda

- Goodstein_Lambda

## Cite

×

Goodstein_Lambda-AFP

    @article{Goodstein_Lambda-AFP,
      author  = {Bertram Felgenhauer},
      title   = {Implementing the Goodstein Function in λ-Calculus},
      journal = {Archive of Formal Proofs},
      month   = {February},
      year    = {2020},
      note    = {\url{https://isa-afp.org/entries/Goodstein_Lambda.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Feb 24, 2020 : Isabelle2019