30,86 €
34,29 €
-10% with code: EXTRA
The Mu-Calculus and the Hierarchy Problem
The Mu-Calculus and the Hierarchy Problem
30,86
34,29 €
  • We will send in 10–14 business days.
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…
34.29
  • Publisher:
  • Year: 1998
  • Pages: 94
  • ISBN-10: 8876422838
  • ISBN-13: 9788876422836
  • Format: 16.8 x 23.9 x 0.8 cm, minkšti viršeliai
  • Language: English
  • SAVE -10% with code: EXTRA

The Mu-Calculus and the Hierarchy Problem (e-book) (used book) | bookbook.eu

Reviews

Description

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.

EXTRA 10 % discount with code: EXTRA

30,86
34,29 €
We will send in 10–14 business days.

The promotion ends in 22d.12:28:12

The discount code is valid when purchasing from 10 €. Discounts do not stack.

Log in and for this item
you will receive 0,34 Book Euros!?
  • Author: Giacomo Lenzi
  • Publisher:
  • Year: 1998
  • Pages: 94
  • ISBN-10: 8876422838
  • ISBN-13: 9788876422836
  • Format: 16.8 x 23.9 x 0.8 cm, minkšti viršeliai
  • Language: English 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.

Reviews

  • No reviews
0 customers have rated this item.
5
0%
4
0%
3
0%
2
0%
1
0%
(will not be displayed)