Propositions As Types • 1

Re: R.J. LiptonMathematical 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 Propositions As Types 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 Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

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