cd /news/ai-research/ai-proves-medvedev-logic-is-undecida… · home topics ai-research article
[ARTICLE · art-136145] src=arxiv.org ↗ pub= topic=ai-research verified=true sentiment=· neutral

AI proves Medvedev logic is undecidable

A paper submitted to arXiv on 11 September 2026 by Rodrigo Nicolau Almeida proves that Medvedev's logic of finite problems is undecidable, settling a longstanding open problem. The proof reduces the periodic tiling problem to non-theoremhood in Medvedev's logic, and the same techniques establish undecidability of Skvortsov's logic of infinite problems and show the two logics are distinct, separated by any aperiodic tiling of the plane. The paper states the core idea and technical work of the undecidability proof were obtained using ChatGPT Sol 5.6 and formally verified in Lean by Claude Opus 5.

read2 min views12 publishedSep 21, 2026
AI proves Medvedev logic is undecidable
Image: source
  [Submitted on 11 Sep 2026]


[View PDF](https://arxiv.org/pdf/2609.13359)

[HTML (experimental)](https://arxiv.org/html/2609.13359v1)

Abstract:We show that Medvedev's logic of finite problems, a well-known superintuitionistic logic, is undecidable. The key method is a reduction from the periodic tiling problem to non-theoremhood in Medvedev's logic. This settles a longstanding open problem. Using similar techniques, but reducing instead to the ordinary tiling problem, we likewise obtain undecidability of Skvortsov's logic of infinite problems, and the fact that the two logics are distinct -- in fact, they are separated by any aperiodic tiling of the plane. Due to the fact that Medvedev's logic figures in so many different areas, these results have implications for several fields -- for example, the study of schematic fragments of logics such as propositional dependence logic, or the study of internal logics of toposes.

The core idea and technical work of the undecidability proof were obtained using ChatGPT Sol 5.6, and formally verified in Lean by Claude Opus 5. A detailed methodology section outlines how such results were obtained.

Submission history #

From: Rodrigo Nicolau Almeida [
[view email](https://arxiv.org/show-email/7ee5e864/2609.13359)]

**[v1]** Fri, 11 Sep 2026 17:49:49 UTC (44 KB)

Current browse context:

math.LO

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?) alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?) Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #ai-research 4 stories · sorted by recency
── more on @rodrigo nicolau almeida 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/ai-proves-medvedev-l…] indexed:0 read:2min 2026-09-21 ·