Theorems · Definition · logic and foundations
ManyOneReducible
{α : Type u_1} → {β : Type u_2} → [Primcodable α] → [Primcodable β] → (α → Prop) → (β → Prop) → Propp is many-one reducible to q if there is a computable function translating questions about p
to questions about q.
- Defined in
- Mathlib.Computability.Reduce
- Cited by
- 17 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses no axioms
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Computableproof · cited by 80
Cited by18
Results whose statement or proof uses this declaration.
- ManyOneEquivproof · cited by 16
- ManyOneReducible.transstatement and proof · cited by 6
- OneOneReducible.to_many_onestatement and proof · cited by 4
- toNat_manyOneReduciblestatement · cited by 2
- manyOneReducible_toNatstatement · cited by 2
- disjoin_manyOneReduciblestatement and proof · cited by 2
- ManyOneEquiv.le_congr_leftstatement · cited by 2
- ManyOneEquiv.le_congr_rightstatement and proof · cited by 2
- ManyOneEquiv.transproof · cited by 1
- ComputablePred.computable_of_manyOneReduciblestatement and proof · cited by 1
- manyOneReducible_toNat_toNatstatement and proof · cited by 1
- disjoin_lestatement and proof · cited by 1