Theorems · Inductive type · logic and foundations
Encodable
Type u_1 → Type u_1
Constructively countable type. Made from an explicit injection encode : α → ℕ and a partial
inverse decode : ℕ → Option α. Note that finite types are countable. See Denumerable if you
wish to enforce infiniteness.
- Defined in
- Mathlib.Logic.Encodable.Basic
- Cited by
- 140 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by213
Results whose statement or proof uses this declaration.
- Encodable.encodestatement and proof · cited by 118
- Encodable.decodestatement and proof · cited by 77
- MeasureTheory.Measure.pi_piproof · cited by 31
- Encodable.encodekstatement and proof · cited by 27
- Encodable.decode₂statement and proof · cited by 26
- Set.Countable.toEncodablestatement · cited by 22
- nonempty_encodablestatement · cited by 13
- Directed.sequencestatement and proof · cited by 10
- ULowerstatement and proof · cited by 9
- Encodable.decode_prod_valstatement and proof · cited by 8
- Encodable.encode_injectivestatement and proof · cited by 8
- Encodable.ofCountablestatement · cited by 7
Showing the 200 most cited of 213.