Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Is there any existing literature on what the internal logical of a groupoid might look like?
Please excuse the syntax bashing of this complete amateur, but i came up with:
abstraction introduction:
Γ,x:A⊢A:e:B⊣B:x,ΔΓ⊢A↔B:λx.e:A↔B⊣Δabstraction elimination:
Γ⊢A↔B:f:A↔B⊣ΔΓ⊢B:e:A⊣ΔΓ⊢A:fe:B⊣Δfor a closed grouoid, which “seems truthy”.
1 to 1 of 1