Mathlib Map

Theorems · Definition · logic and foundations

Turing.BlankRel

{Γ : Type u_1} → [Inhabited Γ] → List Γ → List Γ → Prop

BlankRel is the symmetric closure of BlankExtends, turning it into an equivalence relation. Two lists are related by BlankRel if one extends the other by blanks.

Defined in
Mathlib.Computability.TuringMachine.Tape
Cited by
5 results in Mathlib
Foundations
Depth 9 from the axioms · uses no axioms
Assumes
Inhabited
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Turing.BlankRel.setoid · cited by 2BlankRel.setoidTuring.BlankRel.refl · cited by 1BlankRel.reflTuring.BlankRel.symm · cited by 1BlankRel.symmTuring.BlankRel.trans · cited by 1BlankRel.transTuring.BlankRel.above · cited by 0BlankRel.aboveTuring.BlankRel.below · cited by 0BlankRel.belowTuring.BlankRel.eq_def · cited by 0BlankRel.eq_defTuring.BlankRel.equivalence · cited by 0BlankRel.equivalenceTuring.BlankExtends · cited by 5Turing.BlankExtendsTuring.BlankRelCITED BYCITES

Cites1

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by8

Results whose statement or proof uses this declaration.