- 5 Ergebnisse
Kleinster Preis: € 47,23, größter Preis: € 72,29, Mittelwert: € 58,95
1
Mathematical Foundations of Computer Science - Peter A. Fejer|Dan A. Simovici
Bestellen
bei AbeBooks.de
€ 47,23
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Peter A. Fejer|Dan A. Simovici:

Mathematical Foundations of Computer Science - Taschenbuch

2011, ISBN: 1461277922

[EAN: 9781461277927], Neubuch, [PU: Springer New York], ALGORITHMS AUTOMATA FORMALLANGUAGE FORMALLANGUAGES LOGIC PROGRAMVERIFICATION SEMANTICS COMBINATORICS MATHEMATIK SONSTIGES FORMAL LA… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
zuklappen (X)
2
Mathematical Foundations of Computer Science: Sets, Relations, and Induction (Monographs in Computer Science) - Dan A. Simovici, Peter A. Fejer
Bestellen
bei amazon.de
€ 50,89
Versand: € 3,001
Bestellen
Details beim Anbieter
gesponserter Link

Dan A. Simovici, Peter A. Fejer:

Mathematical Foundations of Computer Science: Sets, Relations, and Induction (Monographs in Computer Science) - Taschenbuch

1991, ISBN: 9781461277927

Springer US, Taschenbuch, Auflage: Softcover reprint of the original 1st ed. 1991, 444 Seiten, Publiziert: 1991-01-01T00:00:01Z, Produktgruppe: Buch, 1.47 kg, Informatik, IT-Ausbildung & … Mehr…

Versandkosten:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00)
zuklappen (X)
3
Mathematical Foundations of Computer Science Sets, Relations, and Induction - Simovici, Dan A.; Fejer, Peter A.
Bestellen
bei Achtung-Buecher.de
€ 54,15
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Simovici, Dan A.; Fejer, Peter A.:
Mathematical Foundations of Computer Science Sets, Relations, and Induction - Taschenbuch

2011

ISBN: 1461277922

Softcover reprint of the original 1st ed. 1991 Kartoniert / Broschiert Mathematische Grundlagen, Diskrete Mathematik, Numerische Mathematik, Theoretische Informatik, algorithms; automat… Mehr…

Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien
zuklappen (X)
4
Bestellen
bei Biblio.co.uk
$ 75,05
(ca. € 70,20)
Versand: € 11,661
Bestellen
Details beim Anbieter
gesponserter Link
Peter A. Fejer:
Mathematical Foundations of Computer Science: Sets, Relations, and Induction - Taschenbuch

ISBN: 9781461277927

Paperback / softback. New. Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have … Mehr…

Versandkosten: EUR 11.66 The Saint Bookstore
zuklappen (X)
5
Bestellen
bei Biblio.co.uk
$ 77,28
(ca. € 72,29)
Versand: € 11,721
Bestellen
Details beim Anbieter
gesponserter Link
Peter A. Fejer:
Mathematical Foundations of Computer Science: Sets, Relations, and Induction (Monographs in Computer Science) - Taschenbuch

2012, ISBN: 9781461277927

Springer-Verlag, 2012. Paperback. New. reprint edition. 435 pages. 9.25x6.10x1.00 inches., Springer-Verlag, 2012, 6

Versandkosten: EUR 11.72 Revaluation Books
zuklappen (X)
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Mathematical Foundations of Computer Science: Sets, Relations, and Induction (Monographs in Computer Science)
Autor:
Titel:
ISBN-Nummer:

9781461277927


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.

Detailangaben zum Buch - Mathematical Foundations of Computer Science: Sets, Relations, and Induction (Monographs in Computer Science)


EAN (ISBN-13): 9781461277927
ISBN (ISBN-10): 1461277922
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2012
Herausgeber: Springer US

Buch in der Datenbank seit 2012-12-09T22:13:58+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-12-02T15:34:46+01:00 (Zurich)
ISBN/EAN: 9781461277927

ISBN - alternative Schreibweisen:
1-4612-7792-2, 978-1-4612-7792-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fejer, peter peter, simovici dan, fejér
Titel des Buches: mathematical induction, the mathematical foundations, foundations science, computer science

Daten vom Verlag:

Autor/in: Peter A. Fejer; Dan A. Simovici
Titel: Monographs in Computer Science; Mathematical Foundations of Computer Science - Sets, Relations, and Induction
Verlag: Springer; Springer US
425 Seiten
Erscheinungsjahr: 2011-12-27
New York; NY; US
Gedruckt / Hergestellt in Niederlande.
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
POD
X, 425 p.

BC; Hardcover, Softcover / Mathematik/Sonstiges; Diskrete Mathematik; Verstehen; algorithms; automata; formal language; formal languages; logic; program verification; semantics; combinatorics; Discrete Mathematics; Numerical Analysis; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Mathematical Logic and Foundations; Numerische Mathematik; Theoretische Informatik; Mathematik: Logik; Mathematische Grundlagen; BB; EA

1 Elementary Set Theory.- 1.1 Introduction.- 1.2 Sets, Members, Subsets.- 1.3 Building New Sets.- 1.4 Exercises and Supplements.- 1.5 Bibliographical Comments.- 2 Relations and Functions.- 2.1 Introduction.- 2.2 Relations.- 2.3 Functions.- 2.4 Sequences, Words, and Matrices.- 2.5 Images of Sets Under Relations.- 2.6 Relations and Directed Graphs.- 2.7 Special Classes of Relations.- 2.8 Equivalences and Partitions.- 2.9 General Cartesian Products.- 2.10 Operations.- 2.11 Representations of Relations and Graphs.- 2.12 Relations and Databases.- 2.13 Exercises and Supplements.- 2.14 Bibliographical Comments.- 3 Partially Ordered Sets.- 3.1 Introduction.- 3.2 Partial Orders and Hasse Diagrams.- 3.3 Special Elements of Partially Ordered Sets.- 3.4 Chains.- 3.5 Duality.- 3.6 Constructing New Posets.- 3.7 Functions and Posets.- 3.8 Complete Partial Orders.- 3.9 The Axiom of Choice and Zorn’s Lemma.- 3.10 Exercises and Supplements.- 3.11 Bibliographical Comments.- 4 Induction.- 4.1 Introduction.- 4.2 Induction on the Natural Numbers.- 4.3 Inductively Defined Sets.- 4.4 Proof by Structural Induction.- 4.5 Recursive Definitions of Functions.- 4.6 Constructors.- 4.7 Simultaneous Inductive Definitions.- 4.8 Propositional Logic.- 4.9 Primitive Recursive and Partial Recursive Functions.- 4.10 Grammars.- 4.11 Peano’s Axioms.- 4.12 Well-Founded Sets and Induction.- 4.13 Fixed Points and Fixed Point Induction.- 4.14 Exercises and Supplements.- 4.15 Bibliographical Comments.- 5 Enumerability and Diagonalization.- 5.1 Introduction.- 5.2 Equinumerous Sets.- 5.3 Countable and Uncountable Sets.- 5.4 Enumerating Programs.- 5.5 Abstract Families of Functions.- 5.6 Exercises and Supplements.- 5.7 Bibliographical Comments.- References.
< zum Archiv...