Mathematical Foundations of Computer Science: Vol. 1: Sets, Relations, and Induction (Monographs in Computer Science)
16 Angebote vergleichen

Lieferung aus: Deutschland, zzgl. Versandkosten, 1461277922.
Sets, Relations, and Induction Monographs in Computer Science. Softcover reprint of the original 1st ed. 1991. Sets, Relations, and Induction Monographs in Computer Science. Softcover reprint of the original 1st ed. 1991.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, allnewbooks.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in 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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1991-01-01, Studio: Springer.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, affordable2015.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in 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. Paperback, Ausgabe: Softcover reprint of the original 1st ed. 1991, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1991-01-01, Studio: Springer.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, WonderBook.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in 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. Hardcover, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1990-12-05, Studio: Springer, Verkaufsrang: 2717891.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 24 hours.
Von Händler/Antiquariat, Bookbyte Textbooks.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in 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. Hardcover, Label: Springer, Springer, Produktgruppe: Book, Publiziert: 1990-12-05, Studio: Springer, Verkaufsrang: 2717891.

Von Händler/Antiquariat, Antiquariat Seitenwechsel [61655140], Hildesheim, Germany.
0387974504, ehem. Bibliotheksexpl., Rückensignatur, Bibliotheksstempel innen, ansonsten einwandfrei, Ex-Library, very good condition, as new 3540974504 Sprache: Deutsch Gewicht in Gramm: 800 Groß-8°, OPpbd., IX, 425 S. : with 36 illustrations.

Lieferung aus: Niederlande, 3-4 weken.
bol.com.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 use... Mathematical Foundations of Computer Science, Volume I is the first of two volumes 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 material is treated in a straightforward, systematic, and rigorous manner. The volume is organized by mathematical area, making the material easily accessible to the upper-undergraduate students in mathematics as well as in 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. Productinformatie:Taal: Engels;Afmetingen: 22x234x156 mm;Gewicht: 667,00 gram;ISBN10: 1461277922;ISBN13: 9781461277927; Engels | Paperback | 2011.

Lieferung aus: Vereinigte Staaten von Amerika, Lagernd, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Deutschland, Versandkosten nach: Deutschland.
Von Händler/Antiquariat, Ameis Buchecke GmbH, [3087021].
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Deutschland, Versandfertig in 1 - 2 Werktagen.
Von Händler/Antiquariat, fritzschwarz.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen