Towards a Mechanistic Understanding of Propositional Logical Reasoning in Large Language Models
Danchun Chen, Qiyao Yan, Liangming Pan
TL;DR
This work probes how large language models implement propositional logic reasoning by performing a mechanistic analysis of Qwen3 models on PropLogic-MI. It identifies four interlocking mechanisms—Staged Computation, Information Transmission, Fact Retrospection, and Specialized Attention Heads—that organize reasoning across layers, tokens, and rules. The study demonstrates that these mechanisms generalize across model scales, reasoning depths, and 11 propositional rule categories, arguing for underlying algorithmic strategies rather than mere pattern matching. These insights contribute to a more principled understanding of LLM reasoning and offer a framework for diagnosing and guiding future model design and evaluation in formal logical tasks.
Abstract
Understanding how Large Language Models (LLMs) perform logical reasoning internally remains a fundamental challenge. While prior mechanistic studies focus on identifying taskspecific circuits, they leave open the question of what computational strategies LLMs employ for propositional reasoning. We address this gap through comprehensive analysis of Qwen3 (8B and 14B) on PropLogic-MI, a controlled dataset spanning 11 propositional logic rule categories across one-hop and two-hop reasoning. Rather than asking ''which components are necessary,'' we ask ''how does the model organize computation?'' Our analysis reveals a coherent computational architecture comprising four interlocking mechanisms: Staged Computation (layer-wise processing phases), Information Transmission (information flow aggregation at boundary tokens), Fact Retrospection (persistent re-access of source facts), and Specialized Attention Heads (functionally distinct head types). These mechanisms generalize across model scales, rule types, and reasoning depths, providing mechanistic evidence that LLMs employ structured computational strategies for logical reasoning.
