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

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

David Makinson


This easy-to-follow textbook introduces the mathematical language, wisdom and problem-solving talents that undergraduates have to research computing. The language is partially qualitative, with strategies reminiscent of set, relation, functionality and recursion/induction; however it can also be partially quantitative, with rules of counting and finite chance. Entwined with either are the basic notions of good judgment and their use for illustration and evidence. beneficial properties: teaches finite math as a language for pondering, up to wisdom and talents to be bought; makes use of an intuitive strategy with a spotlight on examples for all common options; brings out the interaction among the qualitative and the quantitative in all components lined, rather within the remedy of recursion and induction; balances conscientiously the summary and urban, ideas and proofs, particular proof and common views; contains spotlight bins that increase universal queries and transparent confusions; presents quite a few routines, with chosen suggestions.

Show sample text content

Download sample