AI-assisted undecidability of Medvedev logic
Almeida and Knudstorp report that Medvedev’s logic of finite problems is undecidable, by reducing periodic plane tiling to non-theoremhood.
Original report: 2026-09-11Decidability of Medvedev logic
Is there an algorithm that decides theoremhood in Medvedev’s logic of finite problems?
Progress records 1
Understand the problem ↓1 record · How we rate progress
Understanding the problem
Read the background
Is there an algorithm that decides theoremhood in Medvedev’s logic of finite problems?
Why it matters
A precise target for comparing mathematical claims, their baselines, and the documented contribution of AI.
What counts as progress
A sourced theorem, construction, algorithm, bound, or substantive formalization with its assumptions and AI role stated.
What to watch for
- Check the exact hypotheses and compare with the stated prior baseline.
- Distinguish a source claim, an available proof, and a reproduced verification.
- Retain human contributions, competing work, corrections, and withdrawals.
Background review: 2026-10-11. Selected sources:
Website timeline
Publication dates and editorial changes.