OurBigBook About$ Donate
 Sign in Sign up

Predecessor function (pred)

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Computability theory Primitive recursive function
2026-10-03  0 By others on same topic  0 Discussions Create my own version
The predecessor function on the nonnegative integers is pred(0)=0 and pred(n+1)=n. This is a primitive recursive function by primitive recursion from the zero and projection functions.

 Ancestors (6)

  1. Primitive recursive function
  2. Computability theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 135 / 3 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 2 / 4H / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook