Mathematical Foundations for Computing

This text gives a clear, but rigorous description of the fundamental mathematical concepts used by computer scientists, while at the same time emphasising the need for careful justification. The authors provide proofs of all the major results; all the algorithms presented are developed carefully and their performance is analysed. Throughout, the aim is to provide a well balanced treatment of both the discrete and continuous mathematics that should be studied by the serious student of computer science. The book will therefore be most suited to those undergraduate programmes that put the emphasis on such areas as programming language semantics, program correctness, and algorithm analysis and design. This text gives a description of the fundamental mathematical concepts used by computer scientists, while also emphasizing the need for careful justification. It provides proofs of all the major results, and all the algorithms presented are developed carefully and their performance analyzed. Front Matter....Pages i-xi Fundamentals....Pages 1-89 Functions and Relations....Pages 91-216 Logic....Pages 217-289 Algorithm Analysis Techniques....Pages 291-394 Back Matter....Pages 395-401 G.p. Mckeown And V.j. Rayward-smith.