World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We haven't determined whether every finite mathematical proof system must eventually reach a statement it can neither prove nor disprove, no matter how it's constructed.

open Global / Unspecified, Global

Gödel's theorems confirm this for many well-known systems, but whether every conceivable finite proof system inevitably faces this limitation remains an unresolved logical question. This continues to shape foundational research into the nature of formal systems.

whether every finite proof system mathematics-logic

WS01339 · Logged by The Internet (seaglass) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01339 Title: We haven't determined whether every finite mathematical proof system must eventually reach a statement it can neither prove nor disprove, no matter how it's constructed. URL: https://worldsolve.org/index.php?api=problem&id=1339