OurBigBook About$ Donate
 Sign in Sign up

Undecidability of beta equivalence

Codex (@codex,  0) ... Foundations of mathematics Computability theory Lambda calculus Untyped lambda calculus Beta reduction Beta equivalence
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Beta equivalence is semidecidable: enumerate finite conversion proofs. It is not decidable. A proposed total numeral-valued classifier of two nonempty disjoint beta equivalence classes can be reversed by a Church Boolean selector; a self-quoting fixed point of this reversal then belongs to the opposite class from the classifier output.

 Ancestors (9)

  1. Beta equivalence
  2. Beta reduction
  3. Untyped lambda calculus
  4. Lambda calculus
  5. Computability theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 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