Author

Pawel Pawlowski

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#generative ai Preprint Sep 2026

Medvedev Logic is Not Decidable. It is {\pi}01 -complete. Who Would Have Guessed?

It is proved that Medvedev logic ML, the intermediate logic of finite problems, is Pi-01-complete under computable many-one reductions, and is not recursively enumerable, a fortiori undecidable, and admits no recursively enumerable sound and complete proof calculus.

Pawel Pawlowski · 0 citations