Propositions As Types Analogy • 1

Posted on January 29, 2013 by Jon Awbrey

Re: R.J. Lipton • Mathematical Tricks

One of my favorite mathematical tricks — it almost seems too tricky to be true — is the Propositions As Types Analogy.

And I see hints the 2‑part analogy can be extended to a 3‑part analogy, as follows.

\text{proof hint : proof : proposition ~::~ untyped term : typed term : type}

See my working notes on the Propositions As Types Analogy for more information.

This entry was posted in Animata, C.S. Peirce, Combinator Calculus, Combinatory Logic, Curry–Howard Isomorphism, Graph Theory, Lambda Calculus, Logic, Logical Graphs, Mathematics, Proof Theory, Propositions As Types Analogy, Type Theory and tagged , , , , , , , , , , , , . Bookmark the permalink.

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.