Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)
Propositional logic allows only for the description of extremely simple language constructions: boolean operations with propositions. It is not powerful enough for representing many constructions used in computer science, linguistics, mathematics or for formalizing significant fragments of reasoning in action, as for example:
• certain students attend all courses;
• no student attends an uninteresting course;
• can we conclude that all courses are interesting?
KeywordsFree Variable Propositional Logic Atomic Formula Conjunctive Normal Form Disjunctive 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.
Unable to display preview. Download preview PDF.
© Springer-Verlag London 2004