Proof of `Elementary properties of the complexity classes` (3rd statement)
groundedproofs/Lax434930Proofs/BasicProperties.lean · lax-434930
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The logarithmic bound is at most the linear polynomial c(n+2).