Automated theorem proving (ATP) for Propositional Classical Logic is an algorithm to check the validity of a formula. It is a very well-known problem which is decidable but co-NP-complete. There are many algorithms for this problem. In this paper, an educationally oriented implementation of Semantic Tableaux method is described. The program has…

Explores the relative strengths and weaknesses of the spreadsheet approach versus specialized mathematical programming software for solving a particular logic puzzle. (KHR)

Described are several programs that enable the user to evaluate derivatives to order n of any elementary function by using the combination of automatic differentiation method and A Programming Language (APL). Programs calculating first- and higher-order derivatives are presented. Selected APL symbols are appended. (YP)

Explores what kinds of calculus-related insights seem to typify calculus-related reasoning. Introduces "qualitative calculus" in which learning is focused on synthesis. Discusses the resemblance and difference between traditional calculus and qualitative calculus, advantages of learning qualitative calculus, and how understanding qualitative…

The objectives of this research were to review existing computer-assisted instruction systems for propositional calculus proofs or elementary logic and to develop an instructional computer program that guides students in the valid construction of propositional calculus proofs. The system is unique in that it provides assistance at each step of the…

Mathematical word problems are notoriously difficult to solve for students at all grade levels. Performance deficiencies have been attributed to students lacking abstract logico-mathematical knowledge or to insufficiently developed language comprehension skills. At least four general sources of difficulty can be distinguished in mathematical word…