Cantitate/Preț
Produs

Sets, Logic and Maths for Computing: Undergraduate Topics in Computer Science

Autor David Makinson
en Limba Engleză Paperback – 20 mai 2020
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.
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 30714 lei

Preț vechi: 38392 lei
-20% Nou

Puncte Express: 461

Preț estimativ în valută:
5877 6183$ 4866£

Carte disponibilă

Livrare economică 24 decembrie 24 - 07 ianuarie 25
Livrare express 10-14 decembrie pentru 3789 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030422172
ISBN-10: 3030422178
Pagini: 351
Ilustrații: XVIII, 398 p. 36 illus.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.64 kg
Ediția:3rd ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Part I: Sets.- Collecting Things Together: Sets.- Comparing Things: Relations.- Associating One Item with Another: Functions.- Recycling Outputs as Inputs: Induction and Recursion.- Part II: Math.- Counting Things: Combinatorics.- Weighing the Odds: Probability.- Squirrel Math: Trees.- Part III: Logic.- Yea and Nay: Propositional Logic.- Something about Everything: Quantificational Logic.- Just Supposing: Proof and Consequence.- Sticking to the Point: Relevance in Logic.

Notă biografică

Dr. David Makinson has taught courses related to the material of this book at the American University of Beirut, King’s College London and, in recent years, the London School of Economics, UK.


Textul de pe ultima copertă

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.
Dr. David Makinson has taught courses related to the material of this book at the American University of Beirut, King’s College London and, in recent years, the London School of Economics, UK.


Caracteristici

Presents a careful selection of the material most needed by students in their first two years studying computer science Emphasizes the interplay between qualitative thinking and calculation, while requiring only a minimal background in mathematics Teaches the material as a language for thinking in, as much as knowledge to be gained Fully updated and expanded new edition featuring more exercises (and more solutions), and an entirely new chapter on relevance in logic