• Title: Mathematical Foundations and Aspects of Discrete Mathematics
• Author(s) Jean Gallier, Jocelyn Quaintance
• Publisher: World Scientific Publishing (2026); eBook (Final Draft)
• Hardcover/Paperback: 835 pages
• eBook: PDF
• Language: English
• ISBN-10/ASIN: 9819822467
• ISBN-13: 978-981982246
• Share This:  

Book Description

This book is an introduction to discrete mathematics with a strong emphasis on formal reasoning. Beginning with the fundamentals of propositional and predicate logic, it develops proof techniques through deduction trees, truth tables, and formal semantics.

• Jean Gallier is a researcher in computational logic at the University of Pennsylvania, where he holds appointments in the Computer and Information Science Department and the Department of Mathematics.

• Amazon

• Discrete and Finite Mathematics
• Algorithms and Data Structures
• Computer Programming
• Introduction to Computer Science

• Mathematical Foundations and Aspects of Discrete Mathematics (Jean Gallier, et al.)
• The Mirror Site (1) - PDF

• Discrete Mathematics: An Open Introduction (Oscar Levin)

  This is a gentle introduction to discrete mathematics. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.

• Applied Discrete Structures, Fundamentals (Al Doerr, et al)

  This book contains most of the fundamental concepts taught in a one semester course in discrete mathematics which is a required course for students in Computer Science, Mathematics and Information Technology.

• Discrete Structures, Logic, and Computability (James L. Hein)

  This book contains programming experiments that are designed to reinforce the learning of discrete mathematics, logic, and computability, provides introductions to those ideas and techniques to understand and practice the art and science of computing.

• A Spiral Workbook for Discrete Mathematics (Harris Kwong)

  This is a book on discrete mathematics with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form.

• Mathematics for Computer Science (Eric Lehman, et al)

  This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. explores the topics of basic combinatorics, number and graph theory, logic and proof techniques.

• Mathematics for Computer Scientists (Gareth J. Janacek, et al)

  The aim of this book is to present some the basic mathematics that is needed by computer scientists. The reader is not expected to be a mathematician and we hope will find what follows useful.

• Lists, Decisions and Graphs - With an Introduction to Probability

  In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT).

• Prolog Experiments in Discrete Math, Logic, and Computability

  This book contains programming experiments that are designed to reinforce the learning of discrete mathematics, logic, and computability. The Prolog programming language is the tool used for the experiments in this book.

• Isomorphism - Mathematics of Programming (Xinyu Liu)

  This book introduces the mathematics behind computer programming. It intents to tell: programming is isomorphic to mathematics. Just like in art and music, there are interesting stories and mathematicians behind the great minds.