Constructing and Implementing Algorithms for the Teaching of Propositional Calculus by Computer.

Saved in:
Bibliographic Details
Title: Constructing and Implementing Algorithms for the Teaching of Propositional Calculus by Computer.
Language: English
Authors: Clark, Kevin Andrew
Peer Reviewed: N
Page Count: 35
Publication Date: 1991
Document Type: Reports - Research
Descriptors: Algorithms, Calculus, College Mathematics, Computer Assisted Instruction, Computer Uses in Education, Higher Education, Mathematical Logic, Mathematics Education, Mathematics Instruction, Mathematics Skills, Programming, Proof (Mathematics), Skill Development
Abstract: 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 proof evaluation. This assistance exists in the form of correcting user input and giving hints that will lead to the correct evaluation of the proof. The program also has the ability to suggest the correct axiom to use in a line of proof. The program is able to evaluate any proof that uses the elementary rules of logic, such as logical equivalence, logical implication, and rules of inference. (Author)
Entry Date: 1994
Accession Number: ED365524
Database: ERIC
Description
Abstract: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 proof evaluation. This assistance exists in the form of correcting user input and giving hints that will lead to the correct evaluation of the proof. The program also has the ability to suggest the correct axiom to use in a line of proof. The program is able to evaluate any proof that uses the elementary rules of logic, such as logical equivalence, logical implication, and rules of inference. (Author)