The Scaling Properties of Implicit Deductive Reasoning in Transformers

arXiv:2605.04330 · cs.AI, cs.CC, cs.LO, cs.SC · Submitted 2026-05-05 · Read on arXiv

cs.AI, cs.CC, cs.LO, cs.SC

Submitted: 2026-05-05

Updated: 2026-09-25

Comments: Accepted TMLR

License: http://creativecommons.org/licenses/by/4.0/

The gist: We investigate the scaling properties of implicit deductive reasoning over Horn clauses in depth-bounded Transformers.

Terminology

Abstract

We investigate the scaling properties of implicit deductive reasoning over Horn clauses in depth-bounded Transformers. By discouraging the reliance on statistical shortcuts via counterfactual data augmentation, and promoting the learning of shared reasoning primitives across direct and CoT modes, we find that in sufficiently deep models with a bidirectional prefix mask, implicit reasoning approaches explicit CoT performance across graph topologies and problem widths, though CoT remains necessary for depth extrapolation. These findings represent a step toward achieving better compositional reasoning in Transformers. The code and models to reproduce this work are available at: https://github.com/envomp/Implicit-Deductive-Reasoning-in-Transformers

Sources

Related papers