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