A teaching tool for proving equivalences between logical formulae

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we describe a teaching tool for proving equivalences between propositional logic formulae, using rewrite rules such as De Morgan's laws and double negation. This tool is based on an earlier tool for rewriting logical formulae into disjunctive normal form (DNF). Both tools make use of a rewrite strategy, which specifies how an exercise can be solved stepwise. Different types of feedback can be calculated automatically from such a strategy specification. We describe a strategy for constructing expert-like equivalence proofs, and present two techniques for improving the proofs that are generated by the strategy. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Lodder, J., & Heeren, B. (2011). A teaching tool for proving equivalences between logical formulae. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6680 LNAI, pp. 154–161). https://doi.org/10.1007/978-3-642-21350-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free