| Книга | Страницы для поиска |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 1123 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 2013 |
| Hobbs C. — A Practical Approach to WBEM/CIM Management | 108 |
| Ebbinghaus H.-D., Flum J., Thomas W. — Mathematical logic | 127 |
| Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 2013 |
| Steen S.W.P. — Mathematical Logic with Special Reference to the Natural Numbers | 56, 64, 68, 81 |
| Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 48 |
| Wegener I. — Complexity of Boolean Functions | 5 |
| Zimand M. — Computational Complexity: A Quantitative Perspective | 55 |
| Halmos P.R., Givant S. — Logic as Algebra | 89 |
| Niedermeier R. — Invitation to Fixed Parameter Algorithms | 58 |
| Sipser M. — Introduction to the theory of computation | 274 |
| Hein J.L. — Discrete Mathematics | 325 |
| Rowe N.C. — Artifical intelligence through Prolog | 179, 354, 382 |
| Papadimitriou C.H. — Computational Complexity | 75 |
| Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 436 (see also “CSAT”) |
| Purdom R.W., Brown C.A. — The analysis of algorithms | 180 |
| Nilsson N.J. — Problem-Solving Methods in Artificial Intelligence | 167, see also Clause form |
| Tanimoto S.L. — The elements of artificial intelligence. An introduction using LISP | 201 |
| Monk J.D. — Mathematical Logic | 128 |
| Luger G.F., Stubblefield W.A. — Artificial Intelligence: Structures and Strategies for Complex Problem Solving | 569—572 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 322 |
| Lawrence C. Paulson — ML for the working programmer | 167—170, 240—242 |
| Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 315 |
| Maier D. — The theory of relational databases | see Normal form |
| Kozen D.C. — The Design And Analysis Of Algorithms | 111, 113, 137, 257, 277 |
| Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 447 |
| Scott M.L. — Programming Language Pragmatics | 643 |
| Hein J.L. — Theory of Computation: An Introduction | 122 |
| Stinson D.R. — Cryptography: Theory and practice | 491 |
| Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 325, 328 |
| Giarratano J.C., Riley G.D. — Expert Systems: Principles and Programming | 129 |
| Gries D. — A Logical Approach to Discrete Math | 67, 135 |
| Salomaa A. — Computation and automata | 162 |
| Hinman P.G. — Fundamentals of Mathematical Logic | 37, 110 |
| Curry H.B. — Foundations of Mathematical Logic | 300 |
| Kneebone G.T. — Mathematical Logic and the Foundations of Mathematics: An Introductory Survey | 67 |
| Ben-Ari M — Mathematical Logic for Computer Science | 67 |
| Spears W.M. — Evolutionary Algorithms. The Role of Mutation and Recombination | 21, 35, 200—201, 209 |
| Davis M., Sigal R., Weyuker E. — Computability, complexity, and languages: Fundamentals of theoretical computer science | 356—360, 364, 368, 392, 393, 444, 446, 447—448, 451—456, 457—458, 461 |
| Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 19 |
| Gossett E. — Discrete Math with Proof | 779 |
| Heinz-Dieter E., Jorg F., Wolfgang T. — Mathematical Logic | 127 |
| Ebbinghaus H., Flum J., Thomas W. — Mathematical Logic: Undergraduate Texts in Mathematics (Undergraduate texts in mathematics) | 127 |
| Ackermann W. — Solvable Cases of the Decision Problem | 19 |
| Anthony M. — Discrete Mathematics Of Neural Networks | 13 |
| Elliott Mendelson — Introduction to mathematical logic | 28 |
| Steen S. — Mathematical Logic with Special Reference to the Natural Numbers | 56, 64, 68, 81 |
| Andrews P.B. — An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 28, 29 |
| Sipser M. — Introduction to the Theory of Computation | 251 |
| Horowitz E., Rajasekaran S., Sahui S. — Computer Algorithms | 502 |
| Gill A. — Applied Algebra for the Computer Sciences | 133 |
| Jones N.D. — Computability and complexity from a programming perspective | see "CNF" |
| Curry H.B. — Foundations of mathematical logic | 300 |
| Gries D. — The science of programming | 27 |
| Clocksin W.F., Mellish C.S. — Programming in Prolog, using the ISO standard | 243 |
| Steen S. — Mathematical Logic | 56, 64, 68, 81 |
|
|
О проекте