Axiom (p>(q>r))>(q>(p>r)) [CCpCqrCqCpr]

This axiom is often called "C", since it corresponds to Curry and Fey's "C" combinator. [Hindley and Meredith, 1990, pg 91]

It should not be confused with the modal logic axiom "C"

In terms of combinators C is:

C x y z => X Z Y

Go to ...

© Copyright 2005 by John Halleck, All Rights Reserved.
This page is
This page was last modified on January 16th, 2005.