Theorems · Theorem · logic and foundations
Partrec.turingReducible
∀ {f g : ℕ →. ℕ}, Partrec f → TuringReducible f gIf a function is partial recursive, then it is recursive in every partial function.
- Defined in
- Mathlib.Computability.TuringDegree
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 29 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PFunstatement and proof · cited by 207
- Partrecstatement and proof · cited by 48
- TuringReduciblestatement · cited by 6
- Partrec.recursiveInproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- partrec_iff_forall_turingReducibleproof · cited by 0