mlsanityData to 7 Oct 2026

Demystifying μ

arXiv 2401.01096 ↗First posted 2 Jan 2024math.LO cs.LOcited by 7

Not on the map. Why?

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.

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

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 4; 2026: 2.

7 papers.

  1. 2025Small Models Struggle to Learn from Strong Reasonerscited by 109
  2. 2026DeepSWE: Measuring Frontier Coding Agents on Original, Long-Horizon Engineering Taskscited by 41
  3. 2025SWE-Synth: Synthesizing Verifiable Bug-Fix Data to Enable Large Language Models in Resolving Real-World Bugscited by 22
  4. 2025Kolmogorov-Arnold Energy Models: Fast, Interpretable Generative Modelingcited by 1
  5. 2024Disentanglement as Identifiable Pushforward Factorisationcited by 0
  6. 2025app.build: A Production Framework for Scaling Agentic Prompt-to-App Generation with Environment Scaffoldingcited by 0
  7. 2026DMD-augmented Unpaired Neural Schr"odinger Bridge for Ultra-Low Field MRI Enhancementcited by 0