Switch to: References

Citations of:

Theories of Computability

Studia Logica 67 (1):140-141 (2001)

Add citations

You must login to add citations.
  1. The complexity of satisfiability for fragments of hybrid logic—Part I.Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber & Felix Weiss - 2010 - Journal of Applied Logic 8 (4):409-421.
    Download  
     
    Export citation  
     
    Bookmark   1 citation