Empty type¶
A type with no inhabitants, representing falsehood under Curry–Howard and serving as the codomain from which negation and ex falso elimination are defined.
Core Idea¶
The empty type can be primitive, a nullary sum or an equivalent impredicative encoding depending on the type theory; uniqueness up to equivalence differs from definitional identity and from a bottom subtype. Because no constructor produces an inhabitant, elimination may derive a term of any target type from a hypothetical empty-type term; a function from P to the empty type therefore represents a proof of not-P. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Empty type belongs to type theory and logic and is useful where the analyst can specify the typed type theory and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the type theory and universe, empty-type notation, formation, absence of constructors, elimination rule, computation rule if any, consistency assumption, negation encoding, nullary coproduct or polymorphic encoding, initial-object property and distinction from bottom type and empty set are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the type theory and universe, empty-type notation, formation, absence of constructors, elimination rule, computation rule if any, consistency assumption, negation encoding, nullary coproduct or polymorphic encoding, initial-object property and distinction from bottom type and empty set are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Empty type. Empty type compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed type theory and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of type theory and logic because they reuse the typed type theory and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Because no constructor produces an inhabitant, elimination may derive a term of any target type from a hypothetical empty-type term; a function from P to the empty type therefore represents a proof of not-P., and type the carrier, state every parameter and convention in the definition, test that the type theory and universe, empty-type notation, formation, absence of constructors, elimination rule, computation rule if any, consistency assumption, negation encoding, nullary coproduct or polymorphic encoding, initial-object property and distinction from bottom type and empty set are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Empty type Domain-specific
Parents (1) — more general patterns this builds on
-
Empty type is a kind of Empty Set Prime
The proposed strict upward parent is
prime:empty_set.
Hierarchy path (1) — routes to 1 parentless root
- Empty type → Empty Set → Set and Membership
Neighborhood in Abstraction Space¶
Empty type sits in a crowded region of the domain-specific corpus (21st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Formal Logic & Type Theory (34 abstractions)
Nearest neighbors
- Type variable — 0.92
- Type theory — 0.91
- Type constructor — 0.91
- Container (type theory) — 0.91
- Identity type — 0.91
Computed from structural-signature embeddings · 2026-09-08