works on
complexity theory 1constructible theories 1decision problems 1formal theories 1provability 1p vs np 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.CC2026

Constructive solvability and the P versus NP problem

Arne Hole

The paper defines a family of decision problems, proves that under a finiteness condition one of them belongs to NP, and shows that no sound, constructible formal theory can prove…