Theorems · Theorem · logic and foundations
Partrec.recursiveIn
∀ {α : Type u_1} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable σ] {f : α →. σ} {O : Set (ℕ →. ℕ)},
Partrec f → RecursiveIn O fIf a partial function is partial recursive, then it is RecursiveIn any oracle set.
- Defined in
- Mathlib.Computability.RecursiveIn
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Primcodablestatement and proof · cited by 325
- PFunstatement and proof · cited by 207
- Partrecstatement and proof · cited by 48
- RecursiveInstatement · cited by 15
- Nat.Partrec.recursiveInproof · cited by 2
Cited by6
Results whose statement or proof uses this declaration.
- Computable.computableInproof · cited by 1
- Partrec.turingReducibleproof · cited by 1
- recursiveIn_empty_iffproof · cited by 0
- RecursiveIn.someproof · cited by 0
- partrec_iff_forall_recursiveIn_singletonproof · cited by 0
- RecursiveIn.noneproof · cited by 0