Introductory Logic and Sets for Computer Scientists
This text provides a practical, modern approach to teaching logic and set theory, equipping students with the necessary mathematical understanding and skills required for the mathematical specification of software. It covers all the areas of mathematics that are considered essential to computer science including logic, set theory, modern algebra (group theory), graph theory and combinatorics, whilst taking into account the diverse mathematical background of the students taking the course. In line with current undergraduate curricula this book uses logic extensively, together with set theory, in mathematical specification of software. Languages such as Z and VDM are used for this purpose. Features
What people are saying - Write a review
We haven't found any reviews in the usual places.
Propositions and propositional connectives
Propositional logic as a language
17 other sections not shown
a x b abstract programs algorithm application argument arithmetic assumption axiom binary relations Boolean algebra Cartesian product Chapter child(x clever clever(x complex conjecture defined definition denoted digital circuit domain elements Example Exercise expression F F F F T F false Figure formal formula free variable functional programming given hasPet identify identity illustrates improve 25 individuals inference rules injective function integers introduced kind(x Lib_Stock logical equivalence logical laws mathematical induction meaning natural numbers nodes notation Note Objectives On completion operations pairs Pele predicate logic premise prime propositions proof properties propositional connectives propositional logic quantifiers rational numbers real numbers reasoning recursive reduction referred representation requirements result schema Section sentences sequence set theory specification sqrt subset succ surjective function symbols syntax tautology theorems true truth table truth values two's complement validity vehicle zero