some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 10, ISSUE 3


1. Classical propositional logic and decidability of variables in intuitionistic propositional logic
  Hajime Ishihara


2. Decidability Results for the Boundedness Problem
  Achim Blumensath, Martin Otto and Mark Weyer


3. A Fragment of Dependence Logic Capturing Polynomial Time
  Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller and Heribert Vollmer


4. Automata theory in nominal sets
  Mikołaj Bojańczyk, Bartek Klin and Sławomir Lasota


5. Reductions to the set of random strings: The resource-bounded case
  Eric Allender, Harry Buhrman, Luke Friedman and Bruno Loff


6. Finite state verifiers with constant randomness
  Cem Say and Abuzer Yakaryılmaz


7. Representations of measurable sets in computable measure theory
  Klaus Weihrauch and Nazanin Tavana-Roshandel


8. Deciding Conditional Termination
  Radu Iosif, Filip Konecny and Marius Bozga


9. On Ramsey properties of classes with forbidden trees
  Jan Foniok


10. A Concurrent Pattern Calculus
  Thomas Given-Wilson, Daniele Gorla and Barry Jay


11. Refinement and Difference for Probabilistic Automata
  Benoît Delahaye, Uli Fahrenberg, Kim G. Larsen and Axel Legay


12. Ambiguity of ω-Languages of Turing Machines
  Olivier Finkel


13. Computable Jordan Decomposition of Linear Continuous Functionals on C[0;1]
  Klaus Weihrauch and Tahereh Jafarikhah


14. When is a container a comonad?
  Danel Ahman, James Chapman and Tarmo Uustalu


15. Random strings and tt-degrees of Turing complete C.E. sets
  Mingzhong Cai, Rodney G Downey, Rachel Epstein, Steffen Lempp and Joseph Miller


16. Categorical Proof Theory of Co-Intuitionistic Linear Logic
  Gianluigi Bellin


17. Analysis of Timed and Long-Run Objectives for Markov Automata
  Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen and Mark Timmer


18. Observationally-induced algebras in Domain Theory
  Thomas Streicher, Ingo Battenfeld and Klaus Keimel


19. Corecursive Algebras, Corecursive Monads and Bloom Monads
  Jiří Adámek, Mahdie Haddadi and Stefan Milius


20. Fourier spectra of measures associated with algorithmically random Brownian motion
  Willem Louw Fouche', Safari Mukeru and George Davie


21. Inferring Algebraic Effects
  Matija Pretnar


22. Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
  Friedrich Neurauter and Aart Middeldorp


23. Improving legibility of natural deduction proofs is not trivial
  Karol Pąk


24. On Separation by Locally Testable and Locally Threshold Testable Languages
  Thomas Place, Lorijn van Rooijen and Marc Zeitoun


25. Constructing categories and setoids of setoids in type theory
  Erik Palmgren and Olov Wilander


Creative Commons