1
T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to algorithms, MIT Press, Cambridge, Massachusetts, Third edition., 2009.
2
W. Hodges, Logic, Penguin, Harmondsworth, 1977.
3
Sedgewick, Robert and Wayne, Kevin Daniel, Algorithms, Addison-Wesley, Upper Saddle River, NJ, 4th ed., 2011.
4
Sedgewick, Robert, Algorithms in C++, Addison-Wesley Pub. Co, Reading, Mass, 1992.
5
Truss, J. K., Discrete mathematics for computer scientists, Addison-Wesley, Harlow, 2nd ed., 1999.
6
Epp, Susanna S., Discrete mathematics with applications, Brooks/Cole, Boston, 2nd ed., 1995.
7
Johnsonbaugh, Richard and London Mathematical Society, Discrete mathematics, Pearson Prentice Hall, Upper Saddle River, N.J., 6th ed., 2005, vol. The JK computer science and mathematics series.
8
Grossman, Peter, Discrete mathematics for computing, Palgrave Macmillan, Basingstoke, 3rd ed., 2009.
9
Nissanke, Nimal, Introductory logic and sets for computer scientists, Addison-Wesley, Harlow, 1999.
10
Raymond M. Smullyan, What is the name of this book?, Penguin, Harmondsworth, 1981.
11
R. M. Smullyan, First-order logic, Springer-Verlag, New York, 1968, vol. Ergebnisse der Mathematik und ihrer Grenzgebiete.
12
R. C. Jeffrey, Formal logic: its scope and limits, McGraw-Hill, 1967.
13
H. J. Keisler and J. W. Robbin, Mathematical logic and computability, The McGraw-Hill Companies, Inc, New York, 1996.
14
Ainsley Robert, Bluff your way in Computers, Oval Books, London, 1999.
