some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

RECENTLY PUBLISHED

The degree structure of Weihrauch-reducibility

  
Kojiro Higuchi and Arno Pauly

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

  
Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard and Camille Vacher

Polylogarithmic Cuts in Models of V0

  
Sebastian Müller

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

  
Hubie Chen and Moritz Müller

Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types

  
Daisuke Kimura and Makoto Tatsuta

Unifying Büchi Complementation Constructions

  
Seth J. Fogarty, Orna Kupferman, Thomas Wilke and Moshe Y. Vardi




Logical Methods in Computer Science is an open-access journal, covered by Thompson ISI (citation index 0.864 ), SCOPUS, DBLP, Mathematical Reviews and Zentralblatt. All journal content is licensed under a Creative Commons license.