Theorems · Definition · logic and foundations
Primrec
{α : Type u_1} → {β : Type u_2} → [Primcodable α] → [Primcodable β] → (α → β) → PropPrimrec f means f is primitive recursive (after
encoding its input and output as natural numbers).
- Defined in
- Mathlib.Computability.Primrec.Basic
- Cited by
- 141 results in Mathlib
- Foundations
- Depth 8 from the axioms, rests on 22 definitions · uses propext
- Assumes
- PrimcodablePrimcodable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Primcodablestatement and proof · cited by 325
- Encodable.encodeproof · cited by 118
- Encodable.decodeproof · cited by 77
- Nat.Primrecproof · cited by 25
Cited by144
Results whose statement or proof uses this declaration.
- Primrec₂proof · cited by 93
- Primrec.compstatement and proof · cited by 80
- Primrec.sndstatement · cited by 66
- Primrec.fststatement · cited by 58
- Primrec.conststatement · cited by 57
- Primrec₂.compstatement and proof · cited by 55
- Primrec.of_eqstatement and proof · cited by 50
- Primrec.to_compstatement and proof · cited by 40
- Primrec.idstatement · cited by 40
- Primrec.to₂statement and proof · cited by 37
- PrimrecPredproof · cited by 23
- Primrec.encode_iffstatement and proof · cited by 18