### Abstract

Ackermann's function is defined in the usual way and a number of its elementary properties are proved. Then, the primitive recursive functions are defined inductively: as a predicate on the functions that map lists of numbers to numbers. It is shown that every primitive recursive function is strictly dominated by Ackermann's function. The formalisation follows an earlier one by Nora Szasz.

### License

BSD License

### Topics

- Logic/Computability

### Session Ackermanns_not_PR

- Primrec

## Cite

×

Ackermanns_not_PR-AFP

    @article{Ackermanns_not_PR-AFP,
      author  = {Lawrence C. Paulson},
      title   = {Ackermann's Function Is Not Primitive Recursive},
      journal = {Archive of Formal Proofs},
      month   = {March},
      year    = {2022},
      note    = {\url{https://isa-afp.org/entries/Ackermanns_not_PR.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Mar 24, 2022 : Isabelle2021-1