Abstract
In this paper, we describe a graph-based approach to the construction of simple mathematical proofs. In contrast with traditional linear proofs, this technique helps the student organize the solution process and provides a visual representation of the proof. This approach has been used to introduce proofs in a discrete structure course. The author has observed a statistically significant increase in students' performance when answering related test problems.
- 1 Gersting, J. Mathematical Structures for Computer Science, 3rd edition. Computer Science Press, 1993. Google Scholar
Digital Library
- 2 Linz, P. An Introduction to Formal Languages and Automata, 2"d edition. D.C. Heath and Company, 1996. Google Scholar
Digital Library
- 3 Lugger, G. and Stubblefield, W. Artificial intelligence: Structures and Strategies for Complex Problem Solving, 3rd edition, Benjamin/Cummings Pub. Co., Inc., 1997. Google Scholar
Digital Library
- 4 Rosen, K. Discrete Mathematics and its Applications, 3r~ edition. McGraw-Hill, Inc., 1995. Google Scholar
Digital Library
Index Terms
Mathematical proofs as graph search problems in theory courses
Recommendations
Mathematical proofs as graph search problems in theory courses
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science educationIn this paper, we describe a graph-based approach to the construction of simple mathematical proofs. In contrast with traditional linear proofs, this technique helps the student organize the solution process and provides a visual representation of the ...
Logic of Negation-Complete Interactive Proofs (Formal Theory of Epistemic Deciders)
We produce a decidable classical normal modal logic of internalised negation-complete and thus disjunctive non-monotonic interactive proofs (LDiiP) from an existing logical counterpart of non-monotonic or instant interactive proofs (LiiP). LDiiP ...







Comments