Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author.
Full-text access to all papers is freely available. No registration or subscription is required, and a free email notification service is available.
The journal is published by Logical Methods in Computer Science e.V., a non-profit organization whose purpose is to facilitate the dissemination of scientific results pertaining to logic in computer science.
Papers can be submitted electronically as pdf-files. On acceptance, authors are asked to provide a source tex file as specified in the Information for Authors. Even though the Journal is divided into volumes for convenience, papers are published on the internet as soon as they are accepted for publication. The goal is to have a fast turnaround of about nine months from submission to publication.
Logical Methods in Computer Science is an overlay journal of the Computing Research Repository (CoRR): see arXiv.org.
Algebraic methods
Automata and logic
Automata and learning
Automated deduction
Categorical models and logic
Coalgebraic methods
Computability and Logic
Computer-aided verification
Concurrency theory
Constraint programming
Cyber-physical systems
Database theory
Defeasible reasoning
Domain theory
Emerging topics: Computational systems in biology
Emerging topics: Quantum computation and logic
Finite model theory
Formalized mathematics
Functional programming and lambda calculus
Inductive logic and learning
Interactive proof checking
Logic and algorithms
Logic and complexity
Logic and games
Logic and probability
Logic for knowledge representation
Logic programming
Logics of programs
Modal and temporal logics
Program analysis and type checking
Program development and specification
Proof complexity
Real time and hybrid systems
Reasoning about actions and planning
Satisfiability
Security
Semantics of programming languages
Term rewriting and equational logic
Type theory and constructive mathematics