skip to main content
article
Free Access

Mathematical proofs as graph search problems in theory courses

Published:01 March 1999Publication History
Skip Abstract Section

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. 1 Gersting, J. Mathematical Structures for Computer Science, 3rd edition. Computer Science Press, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Linz, P. An Introduction to Formal Languages and Automata, 2"d edition. D.C. Heath and Company, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Lugger, G. and Stubblefield, W. Artificial intelligence: Structures and Strategies for Complex Problem Solving, 3rd edition, Benjamin/Cummings Pub. Co., Inc., 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Rosen, K. Discrete Mathematics and its Applications, 3r~ edition. McGraw-Hill, Inc., 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Mathematical proofs as graph search problems in theory courses

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGCSE Bulletin
            ACM SIGCSE Bulletin  Volume 31, Issue 1
            March 1999
            370 pages
            ISSN:0097-8418
            DOI:10.1145/384266
            Issue’s Table of Contents
            • cover image ACM Conferences
              SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
              March 1999
              383 pages
              ISBN:1581130856
              DOI:10.1145/299649
              • Chairmen:
              • Jane Prey,
              • Bob Noonan

            Copyright © 1999 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 March 1999

            Check for updates

            Qualifiers

            • article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!