X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Rudiments of [mu]-calculus (2001)
    Amsterdam ; New York : Elsevier
    Details
    UID:
    b3kat_BV036962279
    Format: 1 Online-Ressource (xvii, 277 p.) , ill , 23 cm
    Edition: 1st ed
    Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3
    ISBN: 0444506209 , 9780444506207
    Series Statement: Studies in logic and the foundations of mathematics v. 146
    Note: Includes bibliographical references (p. [269]-273) and index
    Additional Edition: Reproduktion von Arnold, André, 1945- Rudiments of [mu]-calculus 2001
    Language: English
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    HWR Berlin
    EUV Frankfurt
    TH Brandenburg
    HTW Berlin
    TH Wildau
    BTU Cottbus
    BHT
  • 2
    Book
    Book
    Rudiments of [mu]-calculus / (2001)
    Amsterdam [u.a.] :Elsevier,
    Details
    UID:
    almafu_BV013949214
    Format: XVII, 277 S.
    Edition: 1. ed.
    ISBN: 0-444-50620-9
    Series Statement: Studies in logic and the foundations of mathematics 146
    Note: Hier auch später erschienene, unveränderte Nachdrucke
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    SK 130
    RVK:
    ST 125
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
    FU Berlin get availability status
    UB Potsdam get availability status
    TU Berlin get availability status
  • 3
    Online Resource
    Online Resource
    Rudiments of [mu]-calculus / (2001)
    Amsterdam ; : Elsevier,
    Details
    UID:
    almahu_9947367706002882
    Format: 1 online resource (297 p.)
    Edition: 1st ed.
    ISBN: 1-281-51374-1 , 9786611513740 , 0-08-051645-9 , 0-585-47433-8
    Series Statement: Studies in logic and the foundations of mathematics, v. 146
    Content: This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially
    Note: Description based upon print version of record. , Cover; Copyright; Dedication; Preface; Table of Contents; Chapter 1. Complete lattices and fixed-point theorems; 1.1 Complete lattices; 1.2 Fixed-point theorems; 1.3 Some properties of fixed points; 1.4 Fixed points on product lattices; 1.5 Conway identities; 1.6 Bibliographical notes and sources; Chapter 2. The μ-calculi: Syntax and semantics; 2.1 μ-calculi; 2.2 Functional μ-calculi; 2.3 Fixed-point terms; 2.4 Quotient μ-calculi; 2.5 Powerset interpretations; 2.6 Alternation-depth hierarchy; 2.7 Vectorial μ-calculi; 2.8 Bibliographic notes and sources; Chapter 3. The Boolean μ-calculus , 3.1 Monotone Boolean functions3.2 Powerset interpretations and the Boolean μ-calculus; 3.3 The selection property; 3.4 Bibliographic notes and sources; Chapter 4. Parity games; 4.1 Games and strategies; 4.2 Positional strategies; 4.3 The μ-calculus of games; 4.4 Games for the μ-calculus; 4.5 Weak parity games; 4.6 Bibliographic notes and sources; Chapter 5. The μ-calculus on words; 5.1 Rational languages; 5.2 Nondeterministic automata; 5.3 Terms with intersection; 5.4 Bibliographic notes and sources; Chapter 6. The μ-calculus over powerset algebras; 6.1 Powerset algebras; 6.2 Modal μ-calculus , 6.3 Homomorphisms, μ-homomorphisms, and bisimulations6.4 Bibliographic notes and sources; Chapter 7. The μ-calculus vs. automata; 7.1 Automata over semi-algebras; 7.2 Automata in the μ-calculus perspective; 7.3 Equivalences; 7.4 Bibliographic notes and sources; Chapter 8. Hierarchy problems; 8.1 Introduction; 8.2 The hierarchy of alternating parity tree automata; 8.3 Weak alternating automata; 8.4 Bibliographic notes and sources; Chapter 9. Distributivity and normal form results; 9.1 The propositional μ-calculus; 9.2 Guarded terms; 9.3 Intersection-free terms; 9.4 The powerset construction , 9.5 The vμ case9.6 The simulation theorem; 9.7 Bibliographic notes and sources; Chapter 10. Decision problems; 10.1 Disjunctive mappings; 10.2 Decidability of emptiness for disjunctive μ-terms; 10.3 The regularity theorem; 10.4 The satisfiability over powerset algebras; 10.5 Bibliographic notes and sources; Chapter 11. Algorithms; 11.1 Evaluation of vectorial fixed-point terms; 11.2 Winning positions and winning strategies; 11.3 Bibliographic notes and sources; Bibliography; Index , English
    Additional Edition: ISBN 0-444-50620-9
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    HU Berlin
    FU Berlin
    Charité
  • 4
    Online Resource
    Online Resource
    Rudiments of [mu]-calculus (2001)
    Amsterdam : Elsevier
    Details
    UID:
    gbv_1684905141
    Format: Online-Ressource , xvii, 277 p , ill , 23 cm
    Edition: 1st ed
    Edition: Online-Ausg.] Elsevier e-book collection on ScienceDirect
    ISBN: 0444506209 , 9780444506207
    Series Statement: Studies in logic and the foundations of mathematics v. 146
    Note: Includes bibliographical references (p. [269]-273) and index
    Additional Edition: Erscheint auch als Druck-Ausgabe Arnold, André Rudiments of [my]-calculus Amsterdam [u.a.] : Elsevier, 2001 ISBN 0444506209
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    SK 130
    RVK:
    ST 125
    Keywords: Datenverarbeitung ; Mathematische Logik
    URL: Volltext  (Deutschlandweit zugänglich)
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Stabi Berlin
    UB Potsdam
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 0444106219?
Did you mean 0444506098?
Did you mean 0442006209?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages