£90.58

Discrete Mathematics for Computer Science

Discrete Mathematics

Price data last checked 10 day(s) ago - will refresh soon

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

About as cheap as it gets. The only time it was cheaper was 2 months ago.

£91 today · all-time low £89 (May 2026) · usually £91

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 74 days · 74 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 74 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £91 (39 days, 52.7%)

Price range: £89 - £91

Price levels: 3 different prices over 74 days

Description

This book discusses the role of proofs in mathematics and computer science. In mathematics, a proof involves validating a proposition through logical deductions from axioms. Computer scientists focus on demonstrating program accuracy, given the increasing error susceptibility of software. A community of specialists aims to enhance program precision, extending to verifying computer processor chips for leading manufacturers. Creating mathematical models to affirm program validity is an active study area. A proof, in this context, involves a sequence of logical deductions from axioms and established statements, leading to the desired proposition. While crafting proofs may seem daunting, standard templates offer a framework. Some templates can be interconnected, providing both high-level structure and detailed guidance. The Principle of Mathematical Induction is applied to validate algorithms without computer reliance. Sets underpin modern mathematics and software engineering, introduced with language and typical tasks. Primary set operations' understanding enables proof techniques for functions, relations, and graphs, validating algorithms for specific tasks. The book delves into language describing element collections and sets, providing proof templates for comprehension and construction. The book covers common set operations, introduces additional proof templates, and addresses numbering elements and the Principle of Mathematical Induction. This exploration deepens the understanding of mathematical proofs and their role in computer science applications.

Product Specifications

Format: hardcover
ASIN: 1774698307
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Discrete Mathematics
Domain: Amazon UK
Release Date: 01 December 2023
Listed Since: 13 October 2023

Barcode

No barcode data available

Discrete Mathematics for Computer Science

About as cheap as it gets. The only time it was cheaper was 2 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Introduction to Mathematical Proofs: A Transition to Advanced Mathematics: 26 (Textbooks in Mathematics)

Science Of Learning Mathematical Proofs, The: An Introductory Course

An Introduction to the Language of Mathematics

Understanding Mathematical Proof

Proof Techniques: The All in One Textbook (Haneul Choi Mathematics Textbooks)

Mathematical Intuitionism: Introduction to Proof Theory (Translations of Mathematical Monographs)

Set Theory An Introduction To Independence Proofs: 102 (Studies in Logic and the Foundations of Mathematics): Volume 102

An Introduction to Mathematical Proofs (Textbooks in Mathematics)

Set Theory for Beginners: A Rigorous Introduction to Sets, Relations, Partitions, Functions, Induction, Ordinals, Cardinals, Martin’s Axiom, and Stationary Sets

Handbook of Proof Theory (Volume 137) (Studies in Logic and the Foundations of Mathematics, Volume 137)

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Sets and Proofs: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 258 (London ... Lecture Note Series, Series Number 258)