Ugly duckling theorem¶
A formal result showing that, when every logically definable predicate is weighted equally, any two distinct objects share the same number of properties, so similarity requires inductive bias.
Core Idea¶
The ugly duckling theorem exposes the impossibility of nontrivial similarity from unweighted predicate counting alone. Logical closure generates complementary and compound predicates in symmetric numbers for every object pair, equalizing raw shared-property counts until some predicates receive privileged weight. 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.
The load-bearing residual is not the broad topic of philosophy of classification. It is A formal result showing that, when every logically definable predicate is weighted equally, any two distinct objects share the same number of properties, so similarity requires inductive bias.
Scope of Application¶
Ugly duckling theorem belongs to philosophy of classification and is useful where the analyst can specify a finite object set, primitive predicates, closure under logical connectives, extensional properties, object pairs and a weighting or relevance scheme, then evaluate all extensionally definable predicates are counted under the same finite universe and equal weighting convention. The scope is broad within that domain but bounded by the need for all extensionally definable predicates are counted under the same finite universe and equal weighting convention. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making all extensionally definable predicates are counted under the same finite universe and equal weighting convention the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Ugly duckling theorem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
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 Ugly duckling theorem. Ugly duckling theorem 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: a finite object set, primitive predicates, closure under logical connectives, extensional properties, object pairs and a weighting or relevance scheme. Reject examples whose alleged carrier belongs to a different problem.
- Lock the constitutive rule. Express all extensionally definable predicates are counted under the same finite universe and equal weighting convention independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of philosophy of classification because they reuse a finite object set, primitive predicates, closure under logical connectives, extensional properties, object pairs and a weighting or relevance scheme, Logical closure generates complementary and compound predicates in symmetric numbers for every object pair, equalizing raw shared-property counts until some predicates receive privileged weight., and type the carrier, state every parameter and convention in the definition, test that all extensionally definable predicates are counted under the same finite universe and equal weighting convention, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Ugly duckling theorem Domain-specific
Parents (1) — outgoing typed relations
-
Ugly duckling theorem is a kind of Classification Prime
The candidate literally instantiates prime:classification; What makes it its own entry: A formal result showing that, when every logically definable predicate is weighted equally, any two distinct objects share the same number of properties, so similarity requires inductive bias.
Hierarchy path (1) — routes to 1 parentless root
- Ugly duckling theorem → is a kind of Classification
Neighborhood in Abstraction Space¶
Ugly duckling theorem sits in a crowded region of the domain-specific corpus (32nd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Boolean & Formal Logic Structures (29 abstractions)
Nearest neighbors
- Extension (predicate logic) — 0.88
- Proof by example — 0.88
- Functional completeness — 0.88
- Logical equality — 0.88
- Finite set — 0.88
Computed from structural-signature embeddings · 2026-10-25