Mathematical Foundations of Computer Science.: Volume1, Sets, Relations, and Induction: v. 1 (Monographs in Computer Science) - Tapa dura

Simovici, Dan-A; Fejer, Peter-A

 
9783540974505: Mathematical Foundations of Computer Science.: Volume1, Sets, Relations, and Induction: v. 1 (Monographs in Computer Science)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9780387974507: Mathematical Foundations of Computer Science: Sets, Relations, and Induction: v. 1 (Monographs in Computer Science)

Edición Destacada

ISBN 10:  0387974504 ISBN 13:  9780387974507
Editorial: Springer-Verlag New York Inc., 1990
Tapa dura