Theorem Proving

Theorem proving becomes relevant when finite search and automatic solving are not enough.

Oxpecker does not start as a theorem prover. This section exists to explain the boundary: some claims require induction, strengthened invariants, lemmas, or machine-checkable proof artifacts.

The practical question remains the same: what kind of evidence can a reviewer trust?