OurBigBook About$ Donate
 Sign in Sign up

Church numeral zero test (Zero)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Computability theory Lambda calculus Simply typed lambda calculus Church numeral
2026-10-05  0 By others on same topic  0 Discussions Create my own version
The lambda term
Zero=λn.n(λz.F)T
(1)
returns the Church Boolean T on c0​ and F on every positive Church numeral. Zero iterations leave the initial true value, while at least one iteration replaces it by false. Normal-order beta reduction evaluates a numeral conditional without evaluating an unchosen branch.

 Ancestors (8)

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

 Incoming links (2)

  • Lambda representation of partial computable functions
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 135 / 6 / 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