Theorems · Definition · logic and foundations
PrimrecRel
{α : Type u_1} → {β : Type u_2} → [Primcodable α] → [Primcodable β] → (α → β → Prop) → PropPrimrecRel p means p : α → β → Prop is a
primitive recursive relation, which is to say that
decide ∘ p : α → β → Bool is primitive recursive.
- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
- 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
- PrimrecPredproof · cited by 23
Cited by22
Results whose statement or proof uses this declaration.
- PrimrecRel.compstatement and proof · cited by 17
- Primrec.eqstatement and proof · cited by 12
- PrimrecRel.decidestatement and proof · cited by 6
- Primrec.nat_lestatement · cited by 5
- PrimrecRel.of_eqstatement and proof · cited by 4
- Primrec₂.primrecRelstatement · cited by 3
- Primrec.nat_divproof · cited by 2
- Primrec.nat_ltstatement · cited by 2
- PrimrecRel.comp₂statement · cited by 2
- PrimrecRel.listFilterstatement and proof · cited by 2
- Primrec.nat_findGreateststatement and proof · cited by 1
- PrimrecRel.exists_mem_liststatement and proof · cited by 1