Logical Methods in Computer Science, Volume 11
Volume 11, Number 1, 2015
: On the relative proof complexity of deep inference via atomic flows.
: The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems.
: Effective zero-dimensionality for computable metric spaces.
Matthew S. Bauer
: The Computational Complexity of Propositional Cirquent Calculus.
Volume 11, Number 2, 2015
: Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.
: Generators and relations for n-qubit Clifford operators.
: Weak bisimulation for coalgebras over order enriched monads.
: On absorption in semigroups and n-ary semigroups.
Volume 11, Number 3, 2015
: Verification for Timed Automata extended with Discrete Data Structure.
: New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic.
Volume 11, Number 4, 2015
: Problems in number theory from busy beaver competition.
: Type Reconstruction for the Linear π-Calculus with Composite Regular Types.
: Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees.
: Typed realizability for first-order classical analysis.
, founded at