See a Problem?

Recurring in all these are two kinds of instrument of proof -- logical notably inference by suppositions, reductio ad absurdum, and proof by cases , and mathematical notably induction on the positive integers and on well-founded structures.

Sets, Logic and Maths for Computing

From this book the student can assimilate the basics of these worlds and set out on the paths of computing with understanding and a platform for further study as needed. The Best Books of Check out the top books of the year on our page Best Books of Product details Format Paperback pages Dimensions Looking for beautiful books? Visit our Beautiful Books page and find lovely books for kids, photography lovers and more.

Other books in this series.


  • Jacques le Français (Documents) (French Edition)!
  • 7 Powerful Tips to Help Lose Neck Fat for Elder Women (1 Book 5)?
  • Refine your editions:.
  • Later.
  • Sets, logic and maths for computing / by David Makinson - Details - Trove.
  • God at Work: Sharing Christ on the Job.

Guide to Competitive Programming Antti Laaksonen. Principles and Paradigms Maurizio Gabbrielli. Concise Computer Vision Reinhard Klette.


  • Death is the Down Beat!
  • PROSPERITY CAPSULES?
  • Miss Whistler.

Introduction to Deep Learning Sandro Skansi. An Appetizer Hanne Riis Nielson. Communications and Networking John Cowley.

CS – Combinatorics for Computer Science 1 – Computer and Information Sciences – theranchhands.com

Combinatorial games, induction on discrete structures, discrete mathematical arguments such as tiling and pigeon hole principle are among the topics covered in the latter part of the class. Students will typically be set four assignments. There is an individual oral examination at the end of the class to validate the marks achieved in the four assignments. The resit for the class will take the form of individual assignments as well as an individual oral examination.

Please do not purchase any of the reading material listed below until you have confirmed with the class lecturer that it will be used for this class. Fundamentals of Discrete Math for Computer Science: Many include fully worked solutions.

Enquiries concerning reproduction outside those terms should be sent to the publishers. The use of registered names, trademarks, etc. The publisher makes no representation, express or implied, with regard to the accuracy of the information contained in this book and cannot accept any legal responsibility or liability for any errors or omissions that may be made. Some readers may find it helpful to look at both.

Shop by category

Whoever you are, welcome! For the Student You have finished secondary school and are about to begin at a university or techni- cal college. You want to study computing. The course includes some mathematics — and that was not necessarily your favourite subject. But there is no escape: What Is in This Book? That is where this book comes in. Its purpose is to provide the basic mathematical language that you need to enter the world of the information and computer sciences. It does not contain all the mathematics that you will need through the several years of your undergraduate career.

There are other very good, quite massive, volumes that do that. At some stage, you will find it useful to get one and keep it on your shelf for reference. But experience has convinced this author that no matter how good the compendia are, beginning students tend to feel intimidated, lost and unclear about what parts to focus on.

This short book, in contrast, offers just the basics that you need to know from the beginning, on which you can build further as needed. It also recognizes that you may not have done much mathematics at school, may not have understood very well what was going on and may even have grown to detest it.