In type theory and mathematical logic, System U and System U− are two closely related pure type systems (PTS), i.e. typed λ-calculi specified by a finite set of sorts (universes), axioms between sorts, and rules describing which kinds of dependent function spaces (Π-types) may be formed.
In type theory and mathematical logic, System U and System U− are two closely related pure type systems (PTS), i.e. typed λ-calculi specified by a finite set of sorts (universes), axioms between sorts, and rules describing which kinds of dependent function spaces (Π-types) may be formed.
Source: Wikipedia "System U" · CC BY-SA 4.0
Share this article: X · Bluesky