1 option
Guide to Discrete Mathematics : An Accessible Introduction to the History, Theory, Logic and Applications / by Gerard O'Regan.
- Format:
- Book
- Author/Creator:
- O'Regan, Gerard, author.
- Series:
- Computer Science (Springer-11645)
- Texts in computer science 1868-0941
- Texts in Computer Science, 1868-0941
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Computer arithmetic and logic units.
- Computer logic.
- Computers.
- Discrete Mathematics in Computer Science.
- Arithmetic and Logic Structures.
- Logics and Meanings of Programs.
- History of Computing.
- Mathematical Applications in Computer Science.
- Math Applications in Computer Science.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Arithmetic and Logic Structures.
- Logics and Meanings of Programs.
- History of Computing.
- Mathematical Applications in Computer Science.
- Math Applications in Computer Science.
- Physical Description:
- 1 online resource (XXI, 368 pages) : 117 illustrations.
- Edition:
- First edition 2016.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- This stimulating textbook/reference presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill. Topics and features: Provides an introduction to the building blocks of discrete mathematics, including sets, relations and functions Describes the basics of number theory, the techniques of induction and recursion, and the applications of mathematical sequences, series, permutations, and combinations Presents the essentials of algebra, covering simultaneous and quadratic equations, and the laws of logarithms and indices, in addition to such structures in abstract algebra as monoids, groups, rings, integral domains, fields, and vector spaces Explains the fundamentals of automata theory, matrices, graph theory, cryptography, coding theory, language theory, and the concepts of computability and decidability Reviews the history of logic, discussing propositional and predicate logic, as well as such advanced topics as fuzzy logic, temporal logic, intuitionistic logic, undefined values, theorem provers, and the applications of logic to AI Examines the important field of software engineering, describing formal methods, including the Z specification language Investigates probability and statistics, covering discrete random variables, probability distributions, sample spaces, variance and standard deviation, and hypothesis testing This engaging and clearly written work offers an invaluable overview of discrete mathematics for undergraduate computer science students, and to students of mathematics interested in the rich applications of discrete mathematics to the field of computing.
- Contents:
- Mathematics in Civilization
- Sets, Relations and Functions
- Number Theory
- Mathematical Induction and Recursion
- Sequences, Series and Permutations and Combinations
- Algebra
- Automata Theory
- Matrix Theory
- Graph Theory
- Cryptography
- Coding Theory
- Language Theory and Semantics
- Computability and Decidability
- A Short History of Logic
- Propositional and Predicate Logic
- Advanced Topics in Logic
- Software Engineering Mathematics
- Formal Methods
- Z Formal Specification Language
- Probability, Statistics and Applications.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-44561-8
- 9783319445618
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.