Aims and Scope of Logical Methods in Computer Science
Logical Methods in Computer Science (LMCS) is a peer-reviewed open access scientific journal covering theoretical computer science and applied logic. It was established in 2005. The editor-in-chief is Stefan Milius (Friedrich-Alexander Universität Erlangen-Nürnberg). Less
Key Metrics
CiteScore 

2
Impact Factor 

< 5
SJR 

Q4Computer Science (all)

SNIP 

1.02
Recommended pre-submission checks
Powered by 

Topics Covered on Logical Methods in Computer Science
Logical Methods in Computer Science Journal Specifications
Indexed in the following public directories
Web of Science
Scopus
DOAJ
Inspec
SJR
| Overview | |
| Publisher | LOGICAL METHODS COMPUTER SCIENCE E V |
| Language | English |
| Frequency | Irregular |
| Publication Time | 33 |
| Editorial Review Process | Anonymous peer review |
| General Details | |
| Language | English |
| Society/Institute/Sponsor | Logical Methods in Computer Science e.V. |
| Frequency | Irregular |
| Publication Start Year | 2005 |
| Website URL | Visit website |
| Publication Details | |
| Publication Time | 33 |
| Editorial Review Detail | |
| Information for authors | |
| Author instructions | Visit website |
| Copyright Details | Visit website |
| Deposit Policy | Sherpa/Romeo |
| License type | CC BY |
| OA statement | Visit website |
View less
Planning to publish in Logical Methods in Computer Science ?
Upload your Manuscript to get
- Degree of match
- Common matching concepts
- Additional journal recommendations

Recently Published Papers in Logical Methods in Computer Science
Hardness of monadic second-order formulae over succinct graphs
- 6 Jan 2026
- Logical Methods in Computer Science
Enumeration and updates for conjunctive linear algebra queries through expressibility
- 1 Jan 2026
- Logical Methods in Computer Science
Approximating Queries on Probabilistic Graphs
- 15 Dec 2025
- Logical Methods in Computer Science
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
- 12 Dec 2025
- Logical Methods in Computer Science
Trade-offs between classical and quantum space using spooky pebbling
- 12 Dec 2025
- Logical Methods in Computer Science
Type Isomorphisms for Multiplicative-Additive Linear Logic
- 21 Nov 2025
- Logical Methods in Computer Science
Hardness of monadic second-order formulae over succinct graphs
- 6 Jan 2026
- Logical Methods in Computer Science
Enumeration and updates for conjunctive linear algebra queries through expressibility
- 1 Jan 2026
- Logical Methods in Computer Science
Approximating Queries on Probabilistic Graphs
- 15 Dec 2025
- Logical Methods in Computer Science
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
- 12 Dec 2025
- Logical Methods in Computer Science
Trade-offs between classical and quantum space using spooky pebbling
- 12 Dec 2025
- Logical Methods in Computer Science
Type Isomorphisms for Multiplicative-Additive Linear Logic
- 21 Nov 2025
- Logical Methods in Computer Science