display all the ideas for this combination of texts
1 idea
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
Full Idea: In sentential logic there is a simple proof that all truth functions, of any number of arguments, are definable from (say) 'not' and 'and'. | |
From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §0) | |
A reaction: The point of 'say' is that it can be got down to two connectives, and these are just the usual preferred pair. |