Sets, logic and maths for computing / David Makinson.
Series: Undergraduate topics in computer science: Publisher: Cham, Switzerland : Springer, 2020Edition: Third editionDescription: 1 online resource (408 pages)Content type: text Media type: computer Carrier type: online resource001: 45286ISBN: 9783030422189 (e-book)Subject(s): Computer science -- MathematicsGenre/Form: Electronic books.Additional physical formats: Print version:: Sets, logic and maths for computing.DDC classification: 004.0151 LOC classification: QA76.9.M35 | .M355 2020Online resources: Click to View| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
| eBooks | MAIN LIBRARY Electronic Books | ONLINE | E-BOOK (Browse shelf(Opens below)) | 1 | Available | 45286-1001 |
Browsing MAIN LIBRARY shelves, Shelving location: Electronic Books, Collection: ONLINE Close shelf browser (Hides shelf browser)
Enhanced descriptions from Syndetics:
This easy-to-understand textbook introduces the mathematical language and problem-solving tools essential to anyone wishing to enter the world of computer and information sciences. Specifically designed for the student who is intimidated by mathematics, the book offers a concise treatment in an engaging style.
The thoroughly revised third edition features a new chapter on relevance-sensitivity in logical reasoning and many additional explanations on points that students find puzzling, including the rationale for various shorthand ways of speaking and 'abuses of language' that are convenient but can give rise to misunderstandings. Solutions are now also provided for all exercises.
Topics and features: presents an intuitive approach, emphasizing how finite mathematics supplies a valuable language for thinking about computation; discusses sets and the mathematical objects built with them, such as relations and functions, as well as recursion and induction; introduces core topics of mathematics, including combinatorics and finite probability, along with the structures known as trees; examines propositional and quantificational logic, how to build complex proofs from simple ones, and how to ensure relevance in logic; addresses questions that students find puzzling but may have difficulty articulating, through entertaining conversations between Alice and the Mad Hatter; provides an extensive set of solved exercises throughout the text.This clearly-written textbook offers invaluable guidance to students beginning an undergraduate degree in computer science. The coverage is also suitable for courses on formal methods offered to those studying mathematics, philosophy, linguistics, economics, and political science. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.
Includes index.
Description based on print version record.
Electronic reproduction. Ann Arbor, MI : ProQuest, 2018. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
There are no comments on this title.