1 citations · 2 across the 8 of their papers we have counts for
Showing math.CTShow all
3 papers · 1 filter
math.CT2014
Logical systems II: Free semantics
Michal R. Przybylek
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional an…
math.CT2013
The other pullback lemma
Michal R. Przybylek
Given a composition of two commutative squares, one well-known pullback lemma says that if both squares are pullbacks, then their composition is also a pullback; another well-known…
math.CT2013★ 1 cited
Logical systems I: Lambda calculi through discreteness
Michal R. Przybylek
This paper shows how internal models for polymorphic lambda calculi arise in any 2-category with a notion of discreteness. We generalise to a 2-categorical setting the famous theor…