ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
9
views
23
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,396
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Deduction—CADE-18
The Complexity of the Graded μ-Calculus
other
Author(s):
Orna Kupferman
,
Ulrike Sattler
,
Moshe Y. Vardi
Publication date
(Online):
July 4 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
23
Record
: found
Abstract
: not found
Article
: not found
Results on the propositional μ-calculus
Dexter Kozen
(1983)
0
comments
Cited
209
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Languages, Automata, and Logic
Wolfgang Thomas
(1997)
0
comments
Cited
147
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata on Infinite Objects
Wolfgang Thomas
(1990)
0
comments
Cited
83
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
July 4 2002
Pages
: 423-437
DOI:
10.1007/3-540-45620-1_34
SO-VID:
8610c7a4-58cb-4c2e-b5f5-826438de04d9
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 94
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic
pp. 16
BDD-Based Decision Procedures for \( \mathcal{K} \)
pp. 501
Focussing Proof-Net Construction as a Middleware Paradigm
pp. 63
Formal Verification of a Java Compiler in Isabelle
pp. 144
Proof Development with Ωmega
pp. 195
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
pp. 295
The Quest for Efficient Boolean Satisfiability Solvers
pp. 423
The Complexity of the Graded μ-Calculus
Similar content
4,396
μ-SRXRF characterization of Brazilian emeralds
Authors:
J CURADO
,
M Radtke
,
G Buzamcn
…
UV Photoelectron Spectra of the μ-Hydrido Bridge-Bonded Molecules B2H6, GaBH6, and Ga2H6
Authors:
John Dyke
,
Darren Haggerston
,
Oliver Warschkow
…
Facile Insertion of Carbon Dioxide into Cu2(μ-H) Dinuclear Units Supported by Tetraphosphine Ligands
Authors:
Kanako Nakamae
,
Bunsho Kure
,
Takayuki Nakajima
…
See all similar
Cited by
10
Counting in Trees for Free
Authors:
Helmut Seidl
,
Thomas Schwentick
,
Anca Muscholl
…
Presburger Modal Logic Is PSPACE-Complete
Authors:
Stephane Demri
,
Denis Lugiez
Reasoning About Strategies
Authors:
Fabio Mogavero
,
Aniello Murano
,
Giuseppe Perelli
…
See all cited by