Theorems · Theorem · logic and foundations
ComputablePred.computable_iff
∀ {α : Type u_1} [inst : Primcodable α] {p : α → Prop}, ComputablePred p ↔ ∃ f, Computable f ∧ p = fun a => f a = true- Defined in
- Mathlib.Computability.RE
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Primcodable
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.
- Primcodablestatement and proof · cited by 325
- Computablestatement and proof · cited by 80
- ComputablePredstatement and proof · cited by 17
- Bool.decide_iffproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- ComputablePred.to_reproof · cited by 1
- ComputablePred.computable_of_manyOneReducibleproof · cited by 1