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.
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. 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.
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.
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.
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 (94th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Non-logical symbol — 0.77
- Generalized context-free grammar — 0.77
- Homomorphism — 0.77
- Generation Loss — 0.77
- Set-builder notation — 0.76
Computed from structural-signature embeddings · 2026-09-08