Logical Methods in Computer Science

Aims & Scope✦ Inferred from recent articles

The journal publishes research on theoretical computer science, focusing on formal methods, logic, and computational complexity. Topics include category theory in relation to programming languages and higher categories, analysis of communicating systems and synchronizability, separation logic for software verification, SAT solvers and clause learning algorithms, epistemic logics for knowledge dynamics, interactive proof systems for QBF, rule-based graph programming, probabilistic multiagent systems and game theory, proof complexity, term rewrite systems for security protocols, categorical probability, conjunctive queries in databases, query answering in incomplete datasets, width minimization of first-order sentences, game-theoretic approaches to security control selection, data-driven quantitative verification of probabilistic programs, second-order unification, topology and verification, bounded arithmetic theories, and synthesis of reactive systems.

AI-summarised from recent articles · verify on publisher page →

Based on the Think.Check.Submit framework by DOAJ, COPE & OASPA. All data from verified open sources.

Source: OpenAlex · Note: citations accumulate over time so older years appear higher

SJR Quartile by Discipline

Scimago ranks this journal separately in each subject category — its quartile can differ by discipline.

Subject Classification