• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Mu-Calculus and the Hierarchy Problem

The Mu-Calculus and the Hierarchy Problem

Paperback

Series: Publications of the Scuola Normale Superiore

General MathematicsProbability & Statistics

Currently unavailable to order

ISBN10: 8876422838
ISBN13: 9788876422836
Publisher: Edizioni Della Normale
Published: Oct 1 1998
Pages: 94
Weight: 0.50
Height: 0.31 Width: 6.63 Depth: 9.40
Language: English
The subject of this thesis is the Mu-calculus, which nowadays represents a very active research area in both theoretical and practical Computer Science. The Mu-calculus is a logic capable of expressing least and greatest solutions of fixpoint equations x=f(x), where f is a monotone function mapping some complete ordered set into itself. The thesis has two goals, one expository and one technical. The expository goal is to present some results and problems about the Mu-calculus. On the technical respect, this thesis addresses a specific expressiveness problem of the Mu-calculus, the alternation depth hierarchy problem.

Also in

General Mathematics