From Indirect Object Identification to Syllogisms: Exploring Binary Mechanisms in Transformer Circuits
On the map: Mechanistic interpretability → Circuits and mechanistic analysis
Abstract (arXiv)
Transformer-based language models (LMs) can perform a wide range of tasks, and mechanistic interpretability (MI) aims to reverse engineer the components responsible for task completion to understand their behavior. Previous MI research has focused on linguistic tasks such as Indirect Object Identification (IOI). In this paper, we investigate the ability of GPT-2 small to handle binary truth values by analyzing its behavior with syllogistic prompts, e.g., "Statement A is true. Statement B matches statement A. Statement B is", which requires more complex logical reasoning compared to IOI. Through our analysis of several syllogism tasks of varying difficulty, we identify multiple circuits that mechanistically explain GPT-2's logical-reasoning capabilities and uncover binary mechanisms that facilitate task completion, including the ability to produce a negated token not present in the input prompt through negative heads. Our evaluation using a faithfulness metric shows that a circuit comprising five attention heads achieves over 90% of the original model's performance. By relating our findings to IOI analysis, we provide new insights into the roles of specific attention heads and MLPs in LMs. These insights contribute to a broader understanding of model reasoning and support future research in mechanistic interpretability.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 18 of its 25 references that are in the map. First posted on arXiv 22 Aug 2025.
Builds on
18 of 25 references.
Closest ancestors · 5
Same direction, newest first
- 2024Adaptive Circuit Behavior and Generalization in Mechanistic Interpretability25 Nov
- 2024Universal Neurons in GPT2 Language Models22 Jan
- 2023Circuit Component Reuse Across Tasks in Transformer Language Models12 Oct
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretability28 Apr
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small1 Nov
Other references · 13
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2024Refusal in Language Models Is Mediated by a Single Directioncited by 1,032
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
- 2013Direct and Indirect Effectscited by 280
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 202
- 2023The Hydra Effect: Emergent Self-repair in Language Model Computationscited by 156
- 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 111
- 2020Neuron Shapley: Discovering the Responsible Neuronscited by 98
- 2020Are Neural Nets Modular? Inspecting Functional Modularity Through Differentiable Weight Maskscited by 98
- 2023Copy Suppression: Comprehensively Understanding an Attention Headcited by 76
- 2021Low-Complexity Probing via Finding Subnetworkscited by 64
- 2023A Systematic Comparison of Syllogistic Reasoning in Humans and Language Modelscited by 20
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Emergence of Minimal Circuits for Indirect Object Identification in Attention-Only Transformers
- 2025Beyond Components: Singular Vector-Based Interpretability of Transformer Circuits
- 2025Mechanistic Unveiling of Transformer Circuits: Self-Influence as a Key to Model Reasoning
- 2026Can Language Model Agents be Helpful Circuit Explainers in Mechanistic Interpretability?
- 2025Attention as Binding: A Vector-Symbolic Perspective on Transformer Reasoning
- 2023Towards Interpretable Sequence Continuation: Analyzing Shared Circuits in Large Language Models
- 2024Circuit Compositions: Exploring Modular Structures in Transformer-Based Language Models
- 2026Towards Verifiable Transformers: Solver-Checkable Circuit Explanations