---
title: System U
slug: system-u
qid: 
snapshot: enwiki-001368311002
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1368311002
tags: [20476433, 23603337, 26220375, 29176435, 29176688]
---

# System U

> [!note] Provenance
> Snapshot `enwiki-001368311002` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1368311002> · Licensed CC BY-SA 4.0

In mathematical logic, System U and System U − are pure type systems, i.e. special forms of a typed lambda calculus with an arbitrary number of sorts, axioms and rules (or dependencies between the sorts). System U was proved inconsistent by Jean-Yves Girard in 1972 (and the question of consistency of System U − was formulated). This result led to the realization that Martin-Löf's original 1971 type theory was inconsistent, as it allowed the same "type in type" behaviour that Girard's paradox exploits.

In mathematical logic, System U and System U − are pure type systems, i.e. special forms of a typed lambda calculus with an arbitrary number of sorts, axioms and rules (or dependencies between the sorts). System U was proved inconsistent by Jean-Yves Girard in 1972 (and the question of consistency of System U − was formulated). This result led to the realization that Martin-Löf's original 1971 type theory was inconsistent, as it allowed the same "type in type" behaviour that Girard's paradox exploits.
