Relaxing the Proof Style
In the previous chapter, we defined the propositional calculus, discussed proof strategies and heuristics, and proved many theorems. In this chapter, we provide some flexibility in the use of the propositional calculus. First, we introduce an extension of our proof format in order to shorten some proofs of implications. Second, we show how to present proofs in a less formal style. In doing so, we relate classical proof methods to proofs in the propositional calculus.
KeywordsCase Analysis Turing Machine Left Identity Proof Format Boolean Expression
Unable to display preview. Download preview PDF.