Proof of `First-order reductions are computable`

groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099

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.

Read the Lean proof on GitHub

Description

The library's computability of relativized ordered first-order reductions.