Theorems · Theorem · logic and foundations
ComputablePred.halting_problem_not_re
∀ (n : ℕ), ¬REPred fun c => ¬(c.eval n).Dom
- Defined in
- Mathlib.Computability.Halting
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 104 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Part.Domstatement and proof · cited by 145
- Nat.Partrec.Codestatement and proof · cited by 66
- Nat.Partrec.Code.evalstatement and proof · cited by 25
- REPredstatement and proof · cited by 7
- ComputablePred.computable_iff_re_compl_re'proof · cited by 1
- ComputablePred.halting_problemproof · cited by 1
- ComputablePred.halting_problem_reproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.