some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 5, ISSUE 1


1. The Complexity of Generalized Satisfiability for Linear Temporal Logic
  Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor and Heribert Vollmer


2. Beyond Language Equivalence on Visibly Pushdown Automata
  Jiří Srba


3. The Safe Lambda Calculus
  William Blum and C.-H. Luke Ong


4. The Complexity of Datalog on Linear Orders
  Martin Grohe and Goetz Schwandtner


5. Antichains for the Automata-Based Approach to Model-Checking
  Laurent Doyen and Jean-François Raskin


6. Cut-Simulation and Impredicativity
  Christoph E. Benzmueller, Chad E. Brown and Michael Kohlhase


7. On tiered small jump operators
  Jean-Yves Marion


Creative Commons