Advertisement

Relaxing the Proof Style

  • David Gries
  • Fred B. Schneider
Chapter
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

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.

Keywords

Case Analysis Turing Machine Left Identity Proof Format Boolean Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • David Gries
    • 1
  • Fred B. Schneider
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations