Bertrand: Symbolic Logic Problem-Solving Software
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Using a decomposition/instantiation algorithm inspired by the 'consistency tree' method found in Leblanc and Wisdom's textbook Deductive Logic, Bertrand solves sets of first-order symbolic logic statements (subject-equality supported) for satisfiability (consistency), validity, and equivalence. It also checks single statements for 'logical truth' and 'logical falsity', and produces truth-tables for single truth-functional statements.|
|Levels:||High School (9-12), College|
|Resource Types:||Archives/Download Sites, General Software Miscellaneous|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.