Discrete Mathematics Resources
Computer & Information Systems, Robert Morris University

Materials used by the RMU Interdisciplinary Committee on Discrete Mathematics Applications (Departments of Computer & Information Systems, Mathematics, and Engineering) in course and textbook design.

Textbook and reference resources:

  • [ALM1994] Vicki L. Almstrum, “Limitations in the understanding of mathematical logic by novice computer science students,” Doctoral Thesis, University of Texas at Austin, 1994.
  • [ALM2003] Vicki L. Almstrum, “What is the Attraction to Computing?” Communications of the ACM 46, 9 (September 2003): 51-55.
  • [AND2004] James A. Anderson, Discrete Mathematics with Combinatorics, 2nd ed. (Prentice Hall, 2004)
  • [BAL1991] V. K. Balakrishnan, Introductory Discrete Mathematics (Dover, 1991)
  • [BAR1993] Jon Barwise and John Etchmendy, Tarski's World (Center for the Study of Language and Information, 1993)
  • [BAR1994] Rosalind Barden, Susan Stepney, and David Cooper, Z in Practice (Prentice Hall, 1994)
  • [BAR1998] Stephen Barnett, Discrete Mathematics: Numbers and Beyond (Prentice Hall/Addison-Wesley, 1998)
  • [BAR2002] Jon Barwise and John Echtemendy (in collaboration with Gerard Allwein, Dave Barker-Plummer, and Albert Liu), Language, Proof, and Logic (CSLI, 2002) This book is published as a package with the software for Tarski's World, Fitch, and Boole.
  • [BEL1990] Timothy C. Bell, John G. Cleary, and Ian H. Witten, Text Compression (Prentice Hall, 1990)
  • [BEN2001] Mordechai Ben-Ari, Mathematical Logic for Computer Science, 2nd ed. (Springer, 2001)
  • [BOL1979] Béla Bolobás, Graph Theory: An Introductory Course (Springer, 1979)
  • [BRO2003] Frank M. Brown, Boolean Reasoning: The Logic of Boolean Equations, 2nd ed. (Dover, 2003)
  • [BRU2003] Kim B. Bruce, Robert L. Scot Drysdale, Charles Keleman, and Allen Tucker, “Why Math?” Communications of the ACM 46, 9 (September 2003): 40-44.
  • [CAN2001] Domenico Cantone, Eugenio Omodeo, and Alberto Policriti, Set Theory for Computing (Springer, 2001)
  • [CLA1984] K. L. Clark and F. G. McCabe, micro-PROLOG: Programming in Logic (Prentice Hall, 1984).
  • [CLO2003] William F. Clocksin and Christopher S. Mellish, Programming in Prolog Using the ISO Standard, 5th ed. (Springer, 2003).
  • [COH1986] Daniel I. A. Cohen, Introduction to Computer Theory (Wiley, 1986)
  • [COP1967] Irving F. Copi, Symbolic Logic, 3rd ed. (MacMillan, 1967)
  • [DAV2002] B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 2nd ed. (Cambridge, 2002)
  • [DIE2000] Reinhard Diestel, Graph Theory, 2nd ed. (Springer, 2000).
  • [DOS2002] John A. Dossey, Albert D. Otto, Lawrence E. Spence, and Charles Vanden Eynden, Discrete Mathematics, 4th ed. (Addison Wesley, 2002)
  • [EPP2004] Susanna S. Epp, Discrete Mathematics with Applications, 3rd ed. (Brooks/Cole, 2004)
  • [EVE1979] Shimon Even, Graph Algorithms (Computer Science Press, 1979)
  • [FEI2003] Todd Feil and Joan Krone, Essential Discrete Mathematics for Computer Science (Prentice Hall, 2003)
  • [FOU1992] L. R. Foulds, Graph Theory Applications (Springer, 1992)
  • [GAL1986] Jean H. Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving (Harper and Row, 1986)
  • [GAR2003] Rowan Garnier and John Taylor, Discrete Mathematics for New Technology, 2nd ed. (Institute for Physics, 2002)
  • [GER2003] Judith L. Gersting, Mathematical Structures for Computer Science: A Modern Treatment of Discrete Mathematics, 5th ed.(W. H. Freeman, 2003)
  • [GOO2002] Edgar G. Goodaire and Michael M. Parmenter, Discrete Mathematics with Graph Theory, 2nd ed. (Prentice Hall, 2002)
  • [GOS2003] Eric Gossett, Discrete Mathematics with Proof (Prentice Hall, 2003)
  • [GRA1996] Winfried Karl Grassmann and Jean-Paul Tremblay, Logic and Discrete Mathematics: A Computer Science Perspective (Prentice Hall, 1996)
  • [GRE1978] Carol Horn Greenstein, Dictionary of Logical Terms and Symbols (Van Nostrand Reinhold, 1978)
  • [GRI1993] David Gries and Fred B. Schneider, A Logical Approach to Discrete Math (Springer, 1993)
  • [HAC2002] Charles Hacker and Renate Sitte, “A Computer-based Interactive Teaching Software for the Tracing of Logic Levels in a Digital Circuit,” Global Journal of Engineering Education 6, 1 (2002), 85-90.
  • [HAM2002] Henry Hamburger and Dana Richards, Logic and Language Models for Computer Science (Prentice Hall, 2002)
  • [HAR2003] Darel W. Hardy and Carol L. Walker, Applied Algebra: Codes, Ciphers, and Discrete Algorithms (Prentice Hall, 2003)
  • [HAR2003b] Valerie J. Harvey, Brian Harris, E. Gregory Holdan, Mark M. Maxwell, David F. Wood, eds., Discrete Mathematics Applications for Information Systems Professionals (Pearson, 2003). Supplement to [JOH2001].
  • [HAR2003c] Valerie J. Harvey, Jeanne M. Baugh, Bruce Johnston, Connie M. Ruzich, A. J. Grant, "The Challenge of Negation in Searches and Queries," The Review of Business Information Systems 7, 4 (Fall 2003): 63-75.
  • [HEI2002] James L. Hein, Discrete Structures, Logic, and Computability, 2nd ed. (Jones and Bartlett, 2002)
  • [HEN2003] Peter B. Henderson, “Mathematical Reasoning in Software Engineering Education,” Communications of the ACM 46, 9 (September 2003): 45-50.
  • [HOP1979] John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979)
  • [HRO2004] Juraj Hromkovič, Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Commnication, and Cryptography (Springer, 2004)
  • [HSU2002] John Y. Hsu, Computer Logic: Design Principles and Applications (Springer, 2002)
  • [JOH2004] Richard Johnsonbaugh, Discrete Mathematics, 6th ed. (Prentice Hall, 2004). [JOH2001] 5th ed.
  • [KAW1998] Jalal Kawash, "Systematic Translation of Relational Calculus Expressions to SQL Queries: A Tutorial." 1998.
  • [KIL2003] Haim Kilov, “Discrete Mathematics for Information Systems,” Prologue for [HAR2003b], p. v.
  • [KIN2001] Efim Kinber and Carl Smith, Theory of Computing: A Gentle Introduction (Prentice Hall, 2001)
  • [KOL2004] Bernard Kolman, Robert C. Busby, and Sharon Cutler Ross, Discrete Mathematical Structures, 5th ed. (Prentice Hall, 2004)
  • [MAN1985] Zohar Manna and Richard Waldinger, The Logical Basis for Computer Programming, Vol. 1: Deductive Reasoning (Addison Wesley, 1985)
  • [MAN1990] Zohar Manna and Richard Waldinger, The Logical Basis for Computer Programming, Vol. 2: Deductive Systems (Addison Wesley, 1990)
  • [MAT1998] J. Matoušek and J. Nešetřil, Diskrete Mathematik: Eine Entdeckungsreise (Springer, 1998)
  • [MEY1993] John-Jules Ch. Meyer and Roel J. Wieringa, Deontic Logic in Computer Science (Wiley, 1993)
  • [MOT1986] Joe L. Mott, Abraham Kandel, and Theodore P. Baker, Discrete Mathematics for Computer Scientists & Mathematicians (Reston Prentice Hall, 1986)
  • [NEH2003] Werner Nehrlich, Diskrete Mathematik: Basiswissen für Informatiker (Fachbuchverlag Leipzig, 2003).
  • [PEM2003] Sriram Pemmaraju and Steven Skiena, Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica (Cambridge, 2003).
  • [PIR2001] Thomas L. Pirnot, Mathematics All Around (Addison Wesley, 2001)
  • [POT1991] Ben Potter, Jane Sinclair, and David Till, An Introduction to Formal Specification and Z (Prentice Hall International, 1991)
  • [PRI2000] Erich Prisner, “Geordnete Mengen,” in “Diskrete Mathematik” (BTU-Cottbus, 2000), http://www.math.tu-cottbus.de/INSTITUT/lsgdi/DM/Ordnung.html#Hasse
  • [REE2002] Charles Marchant Reeder, Computer Math Problem Solving for Information Technology (Prentice Hall, 2002)
  • [REV2002] Peter Revesz, Introduction to Constraint Databases (Spring, 2002)
  • [ROS2003] Kenneth A. Ross and Charles R. B. Wright, Discrete Mathematics, 5th ed. (Prentice Hall, 2003)
  • [SAI1992] Hossein Saiedian, “Mathematics of Computing,” Computer Science Education 3, 2 (1992): 203-221.
  • [SKV1986] Romualdus Skvarcius and William B. Robinson, Discrete Mathematics Applications with Computer Science Applications (Benjamin/Cummings, 1986)
  • [SPI1992] J. M. Spivey, The Z Notation: A Reference Model, 2nd ed. (Prentice Hall, 1992)
  • [TRE1975] J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science (McGraw-Hill, 1975)
  • [TRU1999] John Truss, Discrete Mathematics for Computer Scientists, 2nd ed. (Addison-Wesley, 1999)
  • [WAL2000] W. D. Wallis, A Beginner’s Guide to Graph Theory (Birkhäuser, 2000)
  • [WAS2000] Sherwood Washburn, Thomas Marlowe, and Charles T. Rynn, Discrete Mathematics (Addison-Wesley, 2000)
  • [WOO1987] Derick Wood, Theory of Computation (Harper & Row, 1987)
  • [WOO1988] Jim Woodcock and Martin Loomis, Software Engineering Mathematics (Addison-Wesley, 1988)