Theorems · Definition · logic and foundations
PrimrecPred
{α : Type u_1} → [Primcodable α] → (α → Prop) → PropPrimrecPred p means p : α → Prop is a
primitive recursive predicate, which is to say that
decide ∘ p : α → Bool is primitive recursive.
- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Primcodable
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
- Primrecproof · cited by 141
Cited by25
Results whose statement or proof uses this declaration.
- PrimrecRelproof · cited by 22
- PrimrecRel.compstatement · cited by 17
- PrimrecPred.of_eqstatement and proof · cited by 9
- Primrec.itestatement and proof · cited by 9
- Primrec.primrecPredstatement · cited by 8
- Primcodable.subtypestatement and proof · cited by 5
- PrimrecPred.compstatement and proof · cited by 4
- PrimrecPred.notstatement and proof · cited by 4
- Primrec.subtype_valstatement and proof · cited by 3
- Primrec.subtype_val_iffstatement and proof · cited by 3
- PrimrecPred.decidestatement and proof · cited by 3
- PrimrecPred.andstatement and proof · cited by 2