Skip to main content
Ctrl
+
K
Find official pdf at https://textbooks.open.tudelft.nl/textbooks/catalog/book/53
Delftse Foundations of Computation
Chapters
1. Introduction and Learning Objectives
2. Logic
2.1. Propositional Logic
2.2. Boolean Algebra
2.3. Application: Logic Circuits
2.4. Predicate Logic
2.5. Deduction
3. Proof
3.1. A Little Historical Background
3.2. Mathematical Proof
3.3. Proof by Contradiction
3.4. Mathematical Induction
3.6. Application: Recursion and Induction
3.7. Recursive Definitions
3.8. Trees
3.9. Invariants
4. Sets, Functions, and Relations
4.1. Basic Concepts
4.2. The Boolean Algebra of Sets
4.3. Application: Graphs
4.4. Application: Programming with Sets*
4.5. Functions
4.6. Application: Programming with Functions*
4.7. Counting Past Infinity
4.8. Relations
4.9. Application: Relational Databases*
5. Looking Beyond
6. Selected Solutions
6.1. Solutions Propositional Logic
6.2. Solutions Boolean Algebra
6.3. Solutions Predicate Logic
6.4. Solutions Deduction
6.5. Solutions Proof
6.6. Solutions Proof By Contradiction
6.7. Solutions Recursive Definitions
6.8. Solutions Sets Basic
6.11. Contributors to Solutions
7. Further Reading
8. About the Authors
9. Index
.md
.pdf
Selected Solutions
6.
Selected Solutions
#
Tip
Attempt the exercise first before looking at the solution!
