arxiv
PublishedSeptember 30, 2026 at 4:00 AM
—neutral
Learning to Prove, Not Just to Answer: Reinforcement Learning from Formal Verification for Natural-Language Logical Reasoning
Publisher summary· verbatim
arXiv:2609.37203v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly deployed for natural-language logical reasoning, where the final answer is easy to check but the proof behind it is not. In natural-language logical reasoning, an intermediate conclusion should follow from
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivOptimal Hydra: Model Heterogeneous Federated Learning for LLMs using Data-Informed Hydra-Nets1darxivJudging the Judges: Confidence and Disagreement in Rubrics as Rewards1darxivContent associations with answer selection and engagement in supply chain community question answering1darxivORACLE-SWE: Quantifying the Contribution of Critical Information Signals on SWE Agents1dThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗