OurBigBook About$ Donate
 Sign in Sign up

Church numeral arithmetic

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Computability theory Lambda calculus Church encoding Church numeral
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Church numeral successor, addition, multiplication, and exponentiation are represented by λnfx.f(nfx), λmnfx.mf(nfx), λmnfx.m(nf)x, and λmnfx.(nm)fx. The last term takes the base first and the exponent second. Its outer abstractions preserve the usual numeral normal form at exponent zero, implementing m0=1, including 00=1. At base type A, exponentiation uses an exponent at Church type CA→A​ and a base at CA​=(A→A)→A→A.

 Ancestors (8)

  1. Church numeral
  2. Church encoding
  3. Lambda calculus
  4. Computability theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 20 / 4 / 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