# Demystifying μ

arXiv: https://arxiv.org/abs/2401.01096 · HTML: https://mlsanity.com/paper/2401.01096/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Jan 2024.

## Built on by (most cited first, 7 of 7)

- [Small Models Struggle to Learn from Strong Reasoners](https://mlsanity.com/paper/2502.12143/) (2025)
- [DeepSWE: Measuring Frontier Coding Agents on Original, Long-Horizon Engineering Tasks](https://mlsanity.com/paper/2607.07946/) (2026)
- [SWE-Synth: Synthesizing Verifiable Bug-Fix Data to Enable Large Language Models in Resolving Real-World Bugs](https://mlsanity.com/paper/2504.14757/) (2025)
- [Kolmogorov-Arnold Energy Models: Fast, Interpretable Generative Modeling](https://mlsanity.com/paper/2506.14167/) (2025)
- [Disentanglement as Identifiable Pushforward Factorisation](https://mlsanity.com/paper/2410.22559/) (2024)
- [app.build: A Production Framework for Scaling Agentic Prompt-to-App Generation with Environment Scaffolding](https://mlsanity.com/paper/2509.03310/) (2025)
- [DMD-augmented Unpaired Neural Schr"odinger Bridge for Ultra-Low Field MRI Enhancement](https://mlsanity.com/paper/2603.03769/) (2026)

## Abstract (arXiv)

We explore the theory of illfounded and cyclic proofs for the propositional modal μ-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded conceptions of proof and re-enforces the importance of two normal form theorems for the logic: guardedness and disjunctiveness.