Search | About | Preferences | Interact | Help | ||
150 million books. 1 search engine. |
› Find signed collectible books: 'Automata Theory and its Applications (Progress in Computer Science and Applied Logic)'
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.
More editions of Automata Theory and its Applications (Progress in Computer Science and Applied Logic):
› Find signed collectible books: 'Hybrid Systems (Lecture Notes in Computer Science)'
More editions of Hybrid Systems (Lecture Notes in Computer Science):
› Find signed collectible books: 'Logic and Computer Science: Lectures given at the 1st Session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held at Montecatini Terme, ... Mathematics / C.I.M.E. Foundation Subseries)'
The courses given at the 1st C.I.M.E. Summer School of 1988 dealt with the main areas on the borderline between applied logic and theoretical computer science. These courses are recorded here in five expository papers: S. Homer: The Isomorphism Conjecture and its Generalization.- A. Nerode: Some Lectures on Intuitionistic Logic.- R.A. Platek: Making Computers Safe for the World. An Introduction to Proofs of Programs. Part I. - G.E. Sacks: Prolog Programming.- A. Scedrov: A Guide to Polymorphic Types.
More editions of Logic and Computer Science: Lectures given at the 1st Session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held at Montecatini Terme, ... Mathematics / C.I.M.E. Foundation Subseries):
› Find signed collectible books: 'Logic for Applications (Monographs in Computer Science)'
More editions of Logic for Applications (Monographs in Computer Science):
› Find signed collectible books: 'Logic for Applications (Texts & Monographs in Computer Science)'
This book is a rigorous introduction to classical and nonclassical logics which emphasizes deduction as a form of computation. It can be used to teach classical, modal, and intuitistic predicate logic. It also presents the logical and mathematical foundations for resolution theorem proving and Logic Programming. A distinctive feature of this book is its uniform mathematical treatment of logic, based on the tableau method of classical logic, which includes soundness, completeness, compactness, incompleteness, and the theorems of Herb Rand and Skolem-L Wenheim. The same uniform treatment is used for important areas of application in computer science and artificial intelligence. These include resolution theorem proving, Logic Programming and Prolog, Predicate Intuitionistic Logic, and Predicate Modal Logic. There is also an historical appendix and an extensive list of selected references so that both the background and more advanced developments of these subjects can be understood and pursued. This text is appropriate for upper level undergraduate and beginning graduate students.
More editions of Logic for Applications (Texts & Monographs in Computer Science):
› Find signed collectible books: 'Logic for Applications (Texts in Computer Science)'
In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re cent dramatic growth in the applications oflogic to computer science. Thus, our choice oftopics has been heavily influenced by such applications. Of course, we cover the basic traditional topics: syntax, semantics, soundnes5, completeness and compactness as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much ofour book, however, deals with other less traditional topics. Resolution theorem proving plays a major role in our treatment of logic especially in its application to Logic Programming and PRO LOG. We deal extensively with the mathematical foundations ofall three ofthese subjects. In addition, we include two chapters on nonclassical logics - modal and intuitionistic - that are becoming increasingly important in computer sci ence. We develop the basic material on the syntax and semantics (via Kripke frames) for each of these logics. In both cases, our approach to formal proofs, soundness and completeness uses modifications of the same tableau method in troduced for classical logic. We indicate how it can easily be adapted to various other special types of modal logics. A number of more advanced topics (includ ing nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG.
More editions of Logic for Applications (Texts in Computer Science):
› Find signed collectible books: 'Logic Programming and Nonmonotonic Reasoning: Third International Conference, Lpnmr '95 Lexington, Ky, Usa, June 26-28, 1995 : Proceedings (Lecture Notes in Computer Science)'
More editions of Logic Programming and Nonmonotonic Reasoning: Third International Conference, Lpnmr '95 Lexington, Ky, Usa, June 26-28, 1995 : Proceedings (Lecture Notes in Computer Science):
› Find signed collectible books: 'Logical Foundations of Computer Science: Third International Symposium, Lfcs '94 St. Petersburg, Russia, July 11-14, 1994 Proceedings (Lecture Notes in Computer Science)'
More editions of Logical Foundations of Computer Science: Third International Symposium, Lfcs '94 St. Petersburg, Russia, July 11-14, 1994 Proceedings (Lecture Notes in Computer Science):
› Find signed collectible books: 'Logical Foundations of Computer Science--Tver '92: Second International Symposium, Tver, Russia, July 20-24, 1992 : Proceedings (Lecture Notes in Computer Science)'
More editions of Logical Foundations of Computer Science--Tver '92: Second International Symposium, Tver, Russia, July 20-24, 1992 : Proceedings (Lecture Notes in Computer Science):
› Find signed collectible books: 'Recursion Theory (Proceedings of Symposia in Pure Mathematics)'
Book by Nerode, Anil
More editions of Recursion Theory (Proceedings of Symposia in Pure Mathematics):
Founded in 1997, BookFinder.com has become a leading book price comparison site:
Find and compare hundreds of millions of new books, used books, rare books and out of print books from over 100,000 booksellers and 60+ websites worldwide.