| Edition |
1st ed. |
| Description |
1 online resource (xvii, 277 pages) : illustrations |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
|
text file |
| Series |
Studies in logic and the foundations of mathematics, 0049-237X ; v. 146 |
|
Studies in logic and the foundations of mathematics ; v. 146. 0049-237X
|
| Summary |
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. |
| Contents |
1.Complete lattices and fixed-point theorems. 2. The mu-calculi: Syntax and semantics. 3. The Boolean mu-calculus. 4. Parity Games. 5. The mu-calculus on words. 6. The mucalculus over powerset algebras. 7. The mu-calculus versus automata. 8. Hierachy problems. 9. Distributivity and normal form results. 10. Decision problems. 11. Algorithms. |
| Bibliography |
Includes bibliographical references (pages 269-273) and index. |
| Note |
Print version record. |
| Subject |
Algebraic logic.
|
|
Monotonic functions.
|
|
Fixed point theory.
|
|
Lattice theory.
|
|
Machine theory.
|
|
Logique algébrique.
|
|
Fonctions monotones.
|
|
Théorème du point fixe.
|
|
Théorie des treillis.
|
|
Théorie des automates.
|
|
MATHEMATICS -- Algebra -- General.
|
|
Algebraic logic
|
|
Fixed point theory
|
|
Lattice theory
|
|
Machine theory
|
|
Monotonic functions
|
|
Algebraïsche logica.
|
|
Automatentheorie.
|
|
Speltheorie.
|
|
Programmeren (computers)
|
| Added Author |
Niwiski, Damian.
|
| Other Form: |
Print version: Arnold, A. (André), 1945- Rudiments of [mu]-calculus. 1st ed. Amsterdam ; New York : Elsevier, 2001 0444506209 9780444506207 (DLC) 2001267914 (OCoLC)46357984 |
| ISBN |
9780444506207 |
|
0444506209 |
|
0585474338 (electronic bk.) |
|
9780585474335 (electronic bk.) |
|
9780080516455 |
|
0080516459 |
| Standard No. |
(WaSeSS)ssj0000239898 |
|
AU@ 000048130675 |
|
CHNEW 001005969 |
|
DEBBG BV036962279 |
|
DEBBG BV042317293 |
|
DEBSZ 276856058 |
|
DEBSZ 482353708 |
|
NZ1 12434634 |
|
