國立虎尾科技大學 |

Guide to Discrete Mathematics = An Accessible Introduction to the History, Theory, Logic and Applications /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Guide to Discrete Mathematics/ by Gerard O'Regan.
Reminder of title:	An Accessible Introduction to the History, Theory, Logic and Applications /
Author:	O'Regan, Gerard.
Description:	XXI, 368 p. 117 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-319-44561-8
ISBN:	9783319445618

Guide to Discrete Mathematics = An Accessible Introduction to the History, Theory, Logic and Applications /
O'Regan, Gerard.

Guide to Discrete MathematicsAn Accessible Introduction to the History, Theory, Logic and Applications /[electronic resource] :by Gerard O'Regan. - 1st ed. 2016. - XXI, 368 p. 117 illus.online resource. - Texts in Computer Science,1868-0941. - Texts in Computer Science,.

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.

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.

ISBN: 9783319445618

Standard No.: 10.1007/978-3-319-44561-8doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Guide to Discrete Mathematics = An Accessible Introduction to the History, Theory, Logic and Applications /
LDR:03836nam a22004215i 4500 001 980505
003 DE-He213
005 20200702214600.0
007 cr nn 008mamaa
008 201211s2016 gw | s |||| 0|eng d
020 $a 9783319445618 $9 978-3-319-44561-8
024 7 $a 10.1007/978-3-319-44561-8 $2 doi
035 $a 978-3-319-44561-8
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a O'Regan, Gerard. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 783475
245 1 0 $a Guide to Discrete Mathematics $h [electronic resource] : $b An Accessible Introduction to the History, Theory, Logic and Applications / $c by Gerard O'Regan.
250 $a 1st ed. 2016.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a XXI, 368 p. 117 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Computer Science, $x 1868-0941
505 0 $a 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.
520 $a 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.
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 0 $a Computer logic. $3 786340
650 0 $a Computers. $3 565115
650 0 $a Computer mathematics. $3 1199796
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Arithmetic and Logic Structures. $3 672631
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a History of Computing. $3 669953
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
650 2 4 $a Math Applications in Computer Science. $3 669887
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319445601
776 0 8 $i Printed edition: $z 9783319445625
776 0 8 $i Printed edition: $z 9783319830803
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-319-44561-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)