
Academic Journal
Q3Logical Methods in Computer Science
About Logical Methods in Computer Science
Logical Methods in Computer Science is a scholarly journal published by Logical Methods in Computer Science. SCImago 2025 lists it in Q3, with an SJR of 0.334 and H-index of 45.
Coverage: 2005-2026. Research categories: Computational Theory and Mathematics (Q3); Computer Science (miscellaneous) (Q3); Logic (Q3); Theoretical Computer Science (Q3).
Open-access policies and author information
Reported in the official DOAJ public CSV snapshot (2026-09-01), downloaded 2026-10-03. Record updated 2026-08-03. This snapshot does not establish today’s listing status or fee quotation.
Publisher policy links recorded by DOAJ
- Aims and scope ↗
- Editorial board ↗
- Instructions for authors ↗
- Peer-review policy ↗
- Publication fees ↗
- Licence terms ↗
- Copyright policy ↗
Source: DOAJ journal record. Journal metadata is distributed by DOAJ under CC0. Confirm current fees, tax, eligibility and waiver terms with the publisher.
Source-backed journal facts
Topics in published research
Logic, programming, and type systems; Formal Methods in Verification; Logic, Reasoning, and Knowledge; semigroups and automata theory; Computability, Logic, AI Algorithms; Advanced Algebra and Logic.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
Stefan Kiefer, Andrew Ryzhikov
2026-09-25 · DOI: 10.46298/lmcs-22(3:10)2026JustAct: A Framework for Auditable Multi-Agent Systems Regulated by Inter-Organisational Policies
Christopher A. Esterhuyse, Tim Müller, L. Thomas van Binsbergen
2026-09-22 · DOI: 10.46298/lmcs-22(3:9)2026Confluence of conditional rewriting modulo
Salvador Lucas
2026-09-22 · DOI: 10.46298/lmcs-22(3:11)2026A Dichotomy Theorem for Ordinal Ranks in MSO
Damian Niwiński, Paweł Parys, Michał Skrzypczak
2026-09-02 · DOI: 10.46298/lmcs-22(3:8)2026Locality in Residuated-Lattice Structures
James Carr
2026-08-18 · DOI: 10.46298/lmcs-22(3:7)2026The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
Jean Christoph Jung, Jędrzej Kołodziejski
2026-08-12 · DOI: 10.46298/lmcs-22(3:6)2026The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
Stefan Göller, Nathan Grosshans
2026-08-06 · DOI: 10.46298/lmcs-22(3:5)2026Mirroring Call-by-Need, or Values Acting Silly
Beniamino Accattoli, Adrienne Lancelot
2026-07-21 · DOI: 10.46298/lmcs-22(3:3)2026Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
Sean Walsh
2026-07-21 · DOI: 10.46298/lmcs-22(3:4)2026Policies for Fair Exchanges of Resources
Lorenzo Ceragioli, Pierpaolo Degano, Letterio Galletta, Luca Viganò et al.
2026-07-20 · DOI: 10.46298/lmcs-22(3:2)2026Constraint satisfaction problems, compactness and non-measurable sets
Claude Tardif
2026-07-14 · DOI: 10.46298/lmcs-22(3:1)2026A taxonomy of categories for relations
Cipriano Junior Cioffo, Fabio Gadducci, Davide Trotta
2026-07-01 · DOI: 10.46298/lmcs-22(2:36)2026The Bright Side of Timed Opacity
Étienne André, Sarah Dépernet, Engel Lefaucheux
2026-06-29 · DOI: 10.46298/lmcs-22(2:31)2026Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt, Gian Luca Spitzer et al.
2026-06-29 · DOI: 10.46298/lmcs-22(2:33)2026Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
Hakon Robbestad Gylterud, Elisabeth Stenholm, Niccolò Veltri
2026-06-29 · DOI: 10.46298/lmcs-22(2:35)2026A Complete Theory of Sequential Digital Circuits: Denotational, Operational and Algebraic Semantics
Dan R. Ghica, George Kaye, David Sprunger
2026-06-29 · DOI: 10.46298/lmcs-22(2:34)2026Computation by infinite descent made explicit
Sebastian Enqvist
2026-06-23 · DOI: 10.46298/lmcs-22(2:32)2026The calculus of neo-Peircean relations
Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, Pawel Sobocinski et al.
2026-06-19 · DOI: 10.46298/lmcs-22(2:29)2026Hofmann-Streicher lifting of fibred categories
Andrew Slattery, Jonathan Sterling
2026-06-17 · DOI: 10.46298/lmcs-22(2:30)2026Automating Boundary Filling in Cubical Type Theories
Maximilian Doré, Evan Cavallo, Anders Mörtberg
2026-06-15 · DOI: 10.46298/lmcs-22(2:28)2026Reviews
Community Reviews
Version History
October 4, 2026 at 9:28 pm
October 2, 2026