| Книга | Страницы для поиска |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 722 |
| Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 520 |
| Гудрич М.Т., Тамассия Р. — Структуры данных и алгоритмы в Java | 606 |
| Khosrowpour M. — Encyclopedia Of Information Science And Technology | 1316 |
| Becker T., Weispfenning V. — Groebner bases and commutative algebra | 154 |
| Kreuzer M., Robbiano L. — Computational commutative algebra 1 | 92 |
| Velleman D.J. — How to Prove It: A Structured Approach | 204,209,300 |
| Enderton H.B. — Elements of set theory | 178, 244 |
| Hrbacek K., Jech T. — Introduction to Set Theory | 256 |
| Goldblatt R. — Topoi | 314 |
| Todorchevich S., Farah I. — Some Aplications of the method of forcing | 119 |
| Sipser M. — Introduction to the theory of computation | 401 |
| Hein J.L. — Discrete Mathematics | 183, 498 |
| Papadimitriou C.H. — Computational Complexity | 212 |
| Purdom R.W., Brown C.A. — The analysis of algorithms | 41, 55, 416 |
| Sedgewick R. — Algorithms | 423—426, 493 |
| Howie J.M. (ed.) — An Introduction to Semigroup Theory | 19 |
| Tanimoto S.L. — The elements of artificial intelligence. An introduction using LISP | 94 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 179, 493 |
| Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 403 |
| Tucker А. — Applied Combinatorics | 137 |
| Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | see “Closure”, “Transitive” |
| Ebbinghaus H.-D., Flum J. — Finite Model Theory | 24, 123, 220 |
| Maier D. — The theory of relational databases | 527 — 528 |
| Kanovei V.G., Reeken M. — Nonstandard Analysis: Axiomatically | 44 |
| Petrich M. — Inverse semigroups | 9 |
| Barwise J. (ed.) — Handbook of Mathematical Logic | 242 |
| Hein J.L. — Theory of Computation: An Introduction | 76, 250 |
| Smullyan R.M., Fitting M. — Set theory and the continuum problem | 177 |
| Ore O., Wilson R.J. — Graphs and Their Uses | 100 |
| Christofides N. — Graph-Theory: an Algorithmic Approach | 21 |
| Fraisse R. — Theory of Relations | 1.4.1 |
| Astfalk G. — Applications on Advanced Architecture Computers | 239, 242 |
| Tucker A. — Applied Combinatorics | 137 |
| Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 540, 650, 872, 906, 907, 912, 919—920 |
| Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | see Reflexive and transitive closure |
| Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 540,650,872,906,907,912,919—920 |
| Geddes K., Czapor S., Labahn G. — Algorithms for computer algebra | 435 |
| Kunen K. — Set theory | 99 |
| Gries D. — A Logical Approach to Discrete Math | 274 |
| Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | see "Closure, transitive" |
| Hinman P.G. — Fundamentals of Mathematical Logic | 56, 491 |
| Du D.-Z., Ko K.-I. — Theory of computational complexity | 110 |
| Seress Á. — Permutation Group Algorithms | 219, 220 |
| Tourlakis G.J. — Lectures in Logic and Set Theory: Set Theory | 232, 262 |
| Lemm J.M., Meurant G. — Computer Solution of Large Linear Systems | 168 |
| Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs | 4, 112 |
| Kaufmann A. — Graphs, dynamic programming, and finite games | 235, 236 |
| Gogolla M. — An Extended Entity-Relationship Model - Fundamentals and Pragmatics | 59 |
| Gossett E. — Discrete Math with Proof | 738 |
| Elliott Mendelson — Introduction to mathematical logic | 213 |
| Andrews P.B. — An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 118, 122 |
| Sipser M. — Introduction to the Theory of Computation | 368 |
| Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 445 |
| Gill A. — Applied Algebra for the Computer Sciences | 33 |
| Yovits M. — Advances in Computers.Volume 26. | 104, 105 |
| Gries D. — The science of programming | 317 |
| Jacky J. — The Way of Z: Practical Programming with Formal Methods | 193, 242, 301, 311 |
| Kunen K. — The Foundations of Mathematics | 47 |
| Knuth D.E. — Selected papers on discrete mathematics | 87, 393 |
| Geddes K.O., Czapor S.R., Labahn G. — Algorithms for computer algebra | 435 |
| Hrbacek K., Jech T. — Introduction to Set Theory, Third Edition, Revised, and Expanded (Pure and Applied Mathematics (Marcel Dekker)) | 256 |
|
|
О проекте