some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

      Issue 5

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   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 2, ISSUE 1


1. Computably Based Locally Compact Spaces
  Paul Taylor


2. Model Checking Probabilistic Pushdown Automata
  Antonín Kučera, Javier Esparza and Richard Mayr


3. Theories for TC0 and Other Small Complexity Classes
  Phuong Nguyen and Stephen Cook


4. Approximate reasoning for real-time probabilistic processes
  Vineet Gupta, Radha Jagadeesan and Prakash Panangaden


5. Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
  Willem Conradie, Valentin Goranko and Dimiter Vakarelov


6. Extending the theory of Owicki and Gries with a logic of progress
  Brijesh Dongol and Doug Goldson


Creative Commons