Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

MFCS
2005
Springer

favoriteEmaildiscussreport

133views Theoretical Computer Science» more MFCS 2005»

The Complexity of Model Checking Higher Order Fixpoint Logic

13 years 10 months ago

The Complexity of Model Checking Higher Order Fixpoint Logic

Download www2.tcs.ifi.lmu.de

This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is hard for every level of the elementary time/space hierarchy and in elementary time/space when restricted to formulas of bounded type order.

Martin Lange, Rafal Somla

Real-time Traffic

Elementary Time/space | Elementary Time/space Hierarchy | MFCS 2005 | Model Checking Problem |

claim paper

Related Content

» The Complexity of Model Checking HigherOrder Fixpoint Logic

» The Complexity of Model Checking Collapsible HigherOrder Pushdown Systems

» ModelChecking Games for Fixpoint Logics with Partial Order Models

» Three notes on the complexity of model checking fixpoint logic with chop

» A Solver for Modal Fixpoint Logics

» A Practical Linear Time Algorithm for Trivial Automata Model Checking of HigherOrder Recur...

» Pure Type Systems in Rewriting Logic Specifying Typed HigherOrder Languages in a FirstOrde...

» HOL2P A System of Classical Higher Order Logic with Second Order Polymorphism

» The Complexity of Games on Higher Order Pushdown Automata

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	MFCS
Authors	Martin Lange, Rafal Somla

Comments (0)