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 Paleobotany by
Cover of the book The Urban Climate by
Cover of the book High Acid Crudes by
Cover of the book The Natural Anti-Gal Antibody as Foe Turned Friend in Medicine by
Cover of the book Handbook of Computable General Equilibrium Modeling by
Cover of the book Studies in Natural Products Chemistry by
Cover of the book Pharmacogenetics by
Cover of the book Nuclear Energy in the 21st Century by
Cover of the book Virtualization and Forensics by
Cover of the book Liquid Acquisition Devices for Advanced In-Space Cryogenic Propulsion Systems by
Cover of the book Ultra-Supercritical Coal Power Plants by
Cover of the book Peptides by
Cover of the book Personnel Protection: Executive Worksite Security by
Cover of the book Molecular Pathology of Pituitary Adenomas by
Cover of the book Handbook of the Economics of Population Aging 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