- Author:
- David Makinson
This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions.
Cited By
Aravanis T (2022). Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision, ACM Transactions on Computational Logic, 24:2, (1-29), Online publication date: 30-Apr-2023.- Qadir J and Hasan O (2015). Applying Formal Methods to Networking: Theory, Techniques, and Applications, IEEE Communications Surveys & Tutorials, 17:1, (256-291), Online publication date: 1-Jan-2015.
Recommendations
Disjunctive logic programs, answer sets, and the cut rule
AbstractIn Minker and Rajasekar (J Log Program 9(1):45–74, 1990), Minker proposed a semantics for negation-free disjunctive logic programs that offers a natural generalisation of the fixed point semantics for definite logic programs. We show that this ...
Team Logic and Second-Order Logic
Logic, Language, Information and ComputationTeam logic is a new logic, introduced by Väänänen [12], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing functional dependence of variables on each other. It is known that on the ...
The modal logic S4F, the default logic, and the logic here-and-there
AAAI'07: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1The modal logic S4F provides an account for the default logic of Reiter, and several modal nonmonotonic logics of knowledge and belief. In this paper we focus on a fragment of the logic S4F concerned with modal formulas called modal defaults, and on ...