Finitely π-presented types
Content created by Egbert Rijke, Fredrik Bakke and Jonathan Prieto-Cubides.
Created on 2022-03-07.
Last modified on 2024-10-09.
module univalent-combinatorics.presented-pi-finite-types where
Imports
Idea
A type A
is said to be finitely π₀
-presented if there is a standard pruned
tree T
of height 1 so that A
has a presentation of cardinality width T
,
and A
is said to be finitely πₙ₊₁
-presented if there is a standard pruned
tree T
of height n+2
and a map f : Fin (width T) → A
so that
η ∘ f : Fin (width T) → ║A║₀
is an equivalence, and for each
x : Fin (width T)
the type Ω (A, f x)
is
Recent changes
- 2024-10-09. Fredrik Bakke. Idea text
set-theory
(#1189). - 2023-03-21. Fredrik Bakke. Formatting fixes (#530).
- 2023-03-13. Jonathan Prieto-Cubides. More maintenance (#506).
- 2023-03-06. Fredrik Bakke. Remove redundant whitespace in headers (#486).
- 2023-03-03. Jonathan Prieto-Cubides. Hide imports, toc and many other fixes (#480).