Logical Methods in Computer Science, Volume 13
Volume 13, Number 1, 2017
: A feasible interpolation for random resolution.
Volume 13, Number 2, 2017
Volume 13, Number 3, 2017
: Characterization theorem for the conditionally computable real functions.
, Mohamad Ziadeh
: A revised completeness result for the simply typed λμ-calculus using realizability semantics.
: Hyper Normalisation and Conditioning for Discrete Probability Distributions.
, Ichiro Hasuo
: Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective.
: A new characterization of complete Heyting and co-Heyting algebras.
Volume 13, Number 4, 2017
: Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories.
: Branching Bisimilarity of Normed BPA Processes as a Rational Monoid.
: Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees.
: A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus.
, founded at