|
|
 |
| Результат поиска |
Поиск книг, содержащих: Closure, transitive
| Книга | Страницы для поиска | | Velleman D.J. — How to Prove It: A Structured Approach | 204, 209, 300 | | Enderton H.B. — Elements of set theory | 178, 244 | | Hein J.L. — Discrete Mathematics | 183, 498 | | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 145, 151 | | 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 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 8—9, 47—50, 52 | | Ebbinghaus H.-D., Flum J. — Finite Model Theory | 123, 220 | | Maier D. — The theory of relational databases | see Transitive closure | | Hein J.L. — Theory of Computation: An Introduction | 76, 250 | | Berge C. — The Theory of Graphs | p. 4 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 8—9, 47—50, 52 | | Hinman P.G. — Fundamentals of Mathematical Logic | 56, 491 | | Elliott Mendelson — Introduction to mathematical logic | 213 | | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 151, 157 | | Jacky J. — The Way of Z: Practical Programming with Formal Methods | 193, 242, 301, 311 |
|
|
|
|
О проекте