Advertisement

Propositional Calculus

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

Abstract

This chapter offers an alternative to the widely-held view that boolean expressions are defined by how they are evaluated. Here, expressions are defined in terms of how they can be manipulated. Our goals are to convey a sense of how one manipulates boolean expressions and to teach heuristics and principles for developing proofs. By working out the exercises, the reader can develop a manipulative skill that will prove valuable in later work.

Keywords

Inference Rule Propositional Calculus Truth Table Golden Rule Conjunctive Normal Form 
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