Mathematical foundations of computer science. Vol. 1: Sets, relations and induction.

Fejer, Peter A. und Dan A. Simovici:

ISBN 10: 3540974504 / ISBN 13: 9783540974505

Published by New York : Springer,, 1991

About this Item

0387974504, ehem. Bibliotheksexpl., Rückensignatur, Bibliotheksstempel innen, ansonsten einwandfrei, former library book, very good condition, as new 3540974504 Mit offener Rechnung beliefern wir gerne Buchhandlungen, Bibliotheken, Antiquariate, Schulen, Galerien und Institutionen. Bei neuen uns noch unbekannten privaten Kunden erlauben wir uns die Bitte um Vorauskasse. Wir bitten um Ihr Verständnis. Sprache: Deutsch Gewicht in Gramm: 800 Groß-8°, OPpbd., IX, 425 S. : with 36 illustrations. Seller Inventory # 2037

Bibliographic Details

Title: Mathematical foundations of computer science...

Publisher: New York : Springer,

Publication Date: 1991

Binding: Hardcover

About this title

Synopsis:

This is the first of a two-volume work presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science. This volume treats basic topics, mostly of a set-theoretical nature (sets, functions and relations, partially ordered sets, induction, enumerability and diagonalization) and illustrates the usefulness of mathematical ideas by presenting applications to computer science. Readers will find useful applications in algorithms, databases, semantics of programming languages, formal languages, theory of computation and program verification. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate student in mathematics or computer science and each chapter contains a large number of exercises. The volume can be used as a textbook, but it will also be useful to researchers and professionals who want a thorough presentation of the mathematical tools they need in a single source. In addition, the book can be used effectively as supplementary reading material in computer science courses, particularly those courses which involve the semantics of programming languages, formal languages and automata and logic programming.