|
|
Электронная библиотека
механико-математического факультета
Московского государственного университета
|
|
|
|
|
| Результат поиска |
Поиск книг, содержащих: Church, A.
| Книга | Страницы для поиска | | Хювенен Э., Септянен И. - Мир Лиспа. Том 2. Методы и системы программирования | 246, 248 | | Stevens J.P. - Applied multivariate statistics for the social sciences | 412 | | Jurafsky D., Martin J.H. - Speech and Language Processing | 549 | | Rips J.L. - The psychology of proof: deductive reasoning in human thinking | 57, 66, 67, 351 | | Aho A.V., Sethi R., Ullman J.D. - Compilers: principles, techniques and tools | 387, 462 | | Steen S.W.P. - Mathematical Logic with Special Reference to the Natural Numbers | 31, 65, 66, 68, 202, 203, 230, 273, 286, 378, 379, 606, 609 | | Bach E., Shallit J. - Algorithmic Number Theory (том 1) | 12, 16 | | Tarski A. - Undecidable theories | 4, 17, 19, 31, 35, 61f., 89 | | Behnke H., Bachmann F., Fladt K. - Fundamentals of Mathematics, Volume I: Foundations of Mathematics: The Real Number System and Algebra | 49 | | Feynman R.P. - Feynman Lectures on Computation | 54 | | Dudley R.M., Fulton W. (Ed) - Real Analysis and Probability | 505 | | Burris S., Sankappanavar H.P. - A Course in Universal Algebra | 271 | | Papadimitriou C.H. - Computational Complexity | 51 | | Hopcroft J.E., Motwani R., Ullman J.D. - Introduction to Automata Theory, Languages, and Computation | 318, 366 | | Rockingham G.R. - Deducibility and Decidability | 45, 60 fn, 66-67, 79, 115 | | Li M., Vitanyi P. - An introduction to Kolmogorov complexity and its applications | 24, 35, 41, 51, 53, 87, 149 | | Tanimoto S.L. - The elements of artificial intelligence. An introduction using LISP | 15, 47 | | Monk J.D. - Mathematical Logic | 191, 485 | | Kneale M. - Development of Logic | 396 n., 495 n., 512, 566 n., 576 n., 602 n., 607 n., 617 n., 725 n., 728 n., 729 | | Luger G.F., Stubblefield W.A. - Artificial Intelligence: Structures and Strategies for Complex Problem Solving | 351, 775 | | Neumann J.V. - Theory of Self-Reproducing Automata | 261-262 | | Hein J.L. - Discrete Structures, Logic, and Computability | 713, 754, M5 | | Aho A.V., Ullman J.D. - The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 25, 29 | | Stenlund S. - Combinators, λ-Terms and Proof Theory | 12, 15, 16, 46, 47, 67, 70, 73, 92, 107 | | Rasiowa H. - An algebraic approach to non-classical logics (Studies in logic and the foundations of mathematics volume 78) | 212, 381 | | Barwise J. (ed.) - Handbook of Mathematical Logic | 51, 235, 533, 534, 535, 541, 564, 568, 571, 585, 592, 599, 753, 771, 772, 800, 865, 917, 986, 1007, 1092, 1093, 1095, 1096, 1100, 1102, 1106, 1120, 1126 | | Hazewinkel M. - Handbook of Algebra (part 2) | 25 | | Hein J.L. - Theory of Computation: An Introduction | 399, 442, 551 | | Young R.M. - Excursions in Calculus: An Interplay of the Continuous and the Discrete | 52 | | Gentzen G. - The collected papers of Gerhard Gentzen | 24, 27, 239, 240, 245, 315, 316 | | Barwise J. - The Situation in Logic | xv | | Beth E.W. - The foundations of mathematics: A study in the philosophy of science | 52, 74f., 200, 202, 226, 230, 253, 297, 303f., 307, 356, 363, 375f., 438, 443, 466, 491, 498, 510, 584ff., 598, 603, 605 | | Franzén T. - G #246 del's Theorem: An Incomplete Guide to Its Use and Abuse | 68 | | Hopcroft J.E., Ullman J.D. - Introduction to automata theory, languages, and computation | 176 | | Van Orman Quine W. - Methods of Logic | 191, 245 | | Chandler B., Magnus W. - The history of combinatorial group theory: a case study in the history of ideas | 182 | | Wooldridge M. (ed.), Muller J. (ed.), Tambe M. (ed.) - Intelligent Agents II | 301 | | Aho A.V., Ullman J.D. - The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 25, 29 | | Curry H.B. - Foundations of Mathematical Logic | 12n., 19-22, 25-27, 42n., 53, 86, 115, 116n., 121, 161, 183-184, 247-250, 253, 288, 294, 306, 308-309, 315, 324, 331n., 354, 356-358, 375 | | Partee B.H., Meulen A.T., Wall R.E. - Mathematical Methods in Linguistics | 317, 338, 350, 352, 517, 518, 519, 523, 531 | | Suppes P.(ed.) - Handbook of Proof Theory.Studies in logic the foundations of mathematics.Volume 137. | 146, 358, 391, 415, 416, 419, 420, 422, 433, 434, 437, 440, 442, 476, 686, 688, 694, 695, 711, 714, 727, 730, 741, 755, 758, 774, 775, 777 | | Ackermann W. - Solvable Cases of the Decision Problem | 4, 23, 86, 89, 93 | | Elliott Mendelson - Introduction to mathematical logic | 42, 59, 171, 219, 239 | | Brady J.M. - The theory of computer science: A programming approach | 4, 5, 6, 70, 71, 224, 225, 231, 233 | | McGettrick A.D. - The Definition of Programming Languages | 216 | | Steen S. - Mathematical Logic with Special Reference to the Natural Numbers | 31, 65, 66, 68, 202, 203, 230, 273, 286, 378, 379, 606, 609 | | Robinson A. - Introduction to model theory and to the metamathematics of algebra | 272 | | Curry H.B. - Foundations of mathematical logic | 12n., 19-22, 25-27, 42n., 53, 86, 115, 116n., 121, 161, 183-184, 247-250, 253, 288, 294, 306, 308-309, 315, 324, 331n., 354, 356-358, 375 |
|
|
|
|
|
|
|
О проекте