Reduct¶

Forget selected symbols from a logical or algebraic signature while keeping the same underlying set and exactly the inherited interpretations of every symbol that remains.

Version: v3 · 2026-09-06 · History
Domain-specific #: 2641
Origin domain: mathematics
Subdomain: model theory
Aliases: Signature reduct, Language reduct, Reduct of a structure

Core Idea¶

If \(L_0\subseteq L\) are signatures and (M) is an (L)-structure, the reduct \(M\upharpoonright L_0\) is the (L_0)-structure with the same underlying set as (M) and the same interpretation for every symbol retained in (L_0); symbols in \(L\setminus L_0\) are simply forgotten.^[1] Expansion is the converse relation.

The invariant is same carrier + smaller signature + unchanged retained interpretations. A group becomes a monoid reduct by forgetting inverse, while preserving its set, multiplication, and identity.

Structural Signature¶

A source signature (L).
A sub-signature (L_0).
An (L)-structure (M).
The identical carrier in source and result.
Omission of selected constants, functions, or relations.
Exact inheritance of all retained interpretations.
Satisfaction considered only for formulas in the smaller language.
Expansion as converse.
Possible loss of definability or distinguishability.
Preservation results restricted to the smaller vocabulary.

What It Is Not¶

It is not a substructure, which usually changes the carrier. It is not a quotient, which identifies elements. It is not transport of structure to an equivalent carrier. It is not merely simplifying notation while keeping hidden semantic access to omitted symbols.

A definitional reduct is a related stronger notion: newly removed symbols must be recoverable by definitions in the smaller language.^[2]

Scope of Application¶

Reducts organize comparisons among algebraic signatures, model-theoretic languages, relational presentations, and forgetful constructions. They let theorems be transferred downward when they mention only retained symbols, and expose which properties depend on enriched vocabulary.^[3]

Clarity¶

Name both signatures, the carrier, every removed symbol, and whether the reduct is ordinary or definitional. “Forget structure” is insufficient if the operation actually restricts the universe or changes interpretations.

Manages Complexity¶

The construction isolates a chosen observational vocabulary without rebuilding the object. It turns one rich model into many compatible views and makes language dependence auditable: two expansions can collapse to the same reduct even though their forgotten structure differs.

Abstract Reasoning¶

Specify \(L_0\subseteq L\).
Keep the carrier fixed.
copy interpretations of all (L_0)-symbols exactly.
Remove access to the remaining symbols.
Re-evaluate definability, automorphisms, theories, and elementary properties in (L_0).
Determine whether an expansion can be recovered uniquely, definitionally, or not at all.

Knowledge Transfer¶

The portable pattern is project a richly described object onto a smaller interface without altering what retained observations mean. It transfers to API views, schema projection, capability restriction, and feature hiding. The proposed immediate parent is Abstraction.

Examples¶

\((\mathbb Z,+,-,0)\) reduced by forgetting negation is \((\mathbb Z,+,0)\). An ordered field reduced by forgetting (<) remains a field on the same set. A graph expanded with a named vertex reduces to its unnamed graph by forgetting the constant.^[4]

Structural Tensions¶

Simpler vocabulary versus lost definability.
Same carrier versus different observable theory.
Ordinary forgetting versus definitional recoverability.
More automorphisms after forgetting versus fixed underlying elements.
Downward theorem transfer versus properties using removed symbols.

Structural–Framed Character¶

Projection and information hiding are structural. Signatures, first-order structures, symbol interpretations, and definability are constitutive logical machinery. The identity is domain-specific.

Structural Core vs. Domain Accent¶

The portable core is retain object -> shrink interface -> preserve retained meanings. The domain accent is a logical signature interpreted on a mathematical carrier.

Abstraction is the proposed immediate parent. Projection, Information Loss, Interface, and Equivalence are related. Transport of Structure is not coverage.

The prospective queue contains one strict edge to prime:abstraction. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Reduct Domain-specific

Parents (1) — more general patterns this builds on

Reduct is a kind of Abstraction Prime

Abstraction is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Reduct → Abstraction

Neighborhood in Abstraction Space¶

Reduct sits in a sparse region of the domain-specific corpus (94^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Substructure.
Quotient structure.
Homomorphic image.
Transport of structure.
Computational reduction.
Definitional equivalence.

References¶

[1] Open Logic Project, Model Theory, “Basics of Model Theory: Reducts,” Definition 1.1, https://builds.openlogicproject.org/content/model-theory/model-theory.pdf. registry ↩

[2] Wilfrid Hodges, Model Theory (Cambridge University Press, 1993), sections on reducts and definitional expansions. registry ↩

[3] David Marker, Model Theory: An Introduction (Springer, 2002), Graduate Texts in Mathematics 217, doi:10.1007/b98860. registry ↩

[4] Katrin Tent and Martin Ziegler, A Course in Model Theory (Cambridge University Press, 2012), ISBN 978-0-521-76324-0. registry ↩