- 43
- 3
While I was studying Propositional Calculus from Elliott Mendelson's "Introduction to Mathematical Logic," I came across, on page 18, the proof of functional completeness of [itex]\neg[/itex], [itex]\wedge[/itex], [itex]\lor[/itex] logical connectives as shown below:
The part that does not make sense to me starts from "Then [itex]C_{k}[/itex] has . . ." down to the end of the proof.
Question: Why does [itex]C_{k}[/itex] have the [itex]T[/itex] value for this assignment?
The part that does not make sense to me starts from "Then [itex]C_{k}[/itex] has . . ." down to the end of the proof.
Question: Why does [itex]C_{k}[/itex] have the [itex]T[/itex] value for this assignment?