Rudiments of Calculus

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, Advanced Computing, Computer Science, General Computing
Cover of the book Rudiments of Calculus by , Elsevier Science
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9780080516455
Publisher: Elsevier Science Publication: February 7, 2001
Imprint: North Holland Language: English
Author:
ISBN: 9780080516455
Publisher: Elsevier Science
Publication: February 7, 2001
Imprint: North Holland
Language: English

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way.

This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers.

The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way.

This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers.

The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.

More books from Elsevier Science

Cover of the book Handbook of Economic Forecasting by
Cover of the book Forensic Ecogenomics by
Cover of the book Interpretation of Micromorphological Features of Soils and Regoliths by
Cover of the book Embedded Software by
Cover of the book Handbook of Image and Video Processing by
Cover of the book Plasma Technologies for Textiles by
Cover of the book Optimization in Renewable Energy Systems by
Cover of the book Socializing Children through Language by
Cover of the book Handbook of the Biology of Aging by
Cover of the book Private Equity and Venture Capital in Europe by
Cover of the book Integrated Assessment of Scale Impacts of Watershed Intervention by
Cover of the book Traffic Anomaly Detection by
Cover of the book Oil and Gas Pipelines and Piping Systems by
Cover of the book Corporate Security Management by
Cover of the book Innovative Jacquard Textile Design Using Digital Technologies by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy