Theorems · Theorem · logic and foundations
ComputablePred.rice
- 1000+ list: Rice's theorem
∀ (C : Set (ℕ →. ℕ)),
(ComputablePred fun c => c.eval ∈ C) → ∀ {f g : ℕ →. ℕ}, Nat.Partrec f → Nat.Partrec g → f ∈ C → g ∈ CRice's Theorem
- Defined in
- Mathlib.Computability.Halting
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- PFunstatement and proof · cited by 207
- Computableproof · cited by 80
- Nat.Partrec.Codestatement and proof · cited by 66
- Computable.compproof · cited by 31
- Nat.Partrec.Code.evalstatement and proof · cited by 25
- Computable.sndproof · cited by 21
- Nat.Partrecstatement and proof · cited by 19
- ComputablePredstatement and proof · cited by 17
- Computable.fstproof · cited by 15
- Partrec.compproof · cited by 12
- Partrec.to₂proof · cited by 9
Cited by2
Results whose statement or proof uses this declaration.
- ComputablePred.halting_problemproof · cited by 1
- ComputablePred.rice₂proof · cited by 0