Math 2.0

Areas Type theory and constructive mathematics Topic

Combinatory logic

Summary

This topic is a part of type theory and constructive mathematics. It covers calculi of combinators without variables, their translations to and from the lambda calculus, and their algebraic models.

About this page
TagZSSRVF53RS
URIm2://ZSSRVF53RS
Kindtopic
WritingW0 stub
MSC03B40
Part ofType theory and constructive mathematics
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.