Cited By
View all- Osera PWonnacott D(2017)A blocks-based language for program correctness proofs2017 IEEE Blocks and Beyond Workshop (B&B)10.1109/BLOCKS.2017.8120410(49-52)Online publication date: Oct-2017
Mathematical proofs as graph search problems in theory courses
Pages 110 - 113
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.
References
[1]
Gersting, J. Mathematical Structures for Computer Science, 3rd edition. Computer Science Press, 1993.
[2]
Linz, P. An Introduction to Formal Languages and Automata, 2"d edition. D.C. Heath and Company, 1996.
[3]
Lugger, G. and Stubblefield, W. Artificial intelligence: Structures and Strategies for Complex Problem Solving, 3rd edition, Benjamin/Cummings Pub. Co., Inc., 1997.
[4]
Rosen, K. Discrete Mathematics and its Applications, 3r~ edition. McGraw-Hill, Inc., 1995.
Index Terms
- Mathematical proofs as graph search problems in theory courses
Recommendations
Mathematical proofs as graph search problems in theory courses
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 ...
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
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 1999370 pages
Copyright © 1999 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1999
Check for updates
Qualifiers
- Article
Conference
SIGCSE99
Sponsor:
Acceptance Rates
SIGCSE '99 Paper Acceptance Rate 70 of 190 submissions, 37%;
Overall Acceptance Rate 1,595 of 4,542 submissions, 35%
Upcoming Conference
SIGCSE TS 2025
- Sponsor:
- sigcse
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 347Total Downloads
- Downloads (Last 12 months)59
- Downloads (Last 6 weeks)7
Reflects downloads up to 25 Dec 2024
Other Metrics
Citations
Cited By
View all- Osera PWonnacott D(2017)A blocks-based language for program correctness proofs2017 IEEE Blocks and Beyond Workshop (B&B)10.1109/BLOCKS.2017.8120410(49-52)Online publication date: Oct-2017
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in