Matrices of Concepts¶
A six-position semiotic model that arranges a concept, its inverse, and positive and negative variants into specified relations of duality, contrariety, complementarity, corollary, and association.
Core Idea¶
A matrix of concepts is a specific six-term semiotic grammar. It expands a base opposition into positive and negative variants and makes analysts state how every position relates to several others.
Its value is diagnostic rather than automatic. The symmetry of notation can reveal missing possibilities and dialectical patterns, but only domain interpretation can show that the inverse, valence, and pair relations are real rather than imposed.
Scope of Application¶
- Semiotic analysis. Maps paradigmatic conceptual oppositions.
- Dialectical planning. Organizes positions and counterpositions.
- Art and discourse analysis. Tests structured meanings in texts or images.
- Knowledge representation. Makes relational commitments explicit for critique.
Clarity¶
State the source corpus and domain, A0 and Ā0 definitions, why they are inverse or dual, criteria for positive and negative valence, all four variants, each named pair relation, ambiguous or empty cells, alternative matrices, and evidence that the diagram explains rather than merely redescribes. Inclusion test: Require six explicitly filled positions derived from a concept and its inverse, with positive and negative variants and the model's named pairwise relations interpreted in a domain. Exclusion test: Exclude any 2×3 table, a generic concept map, a semiotic square with four terms, a sentiment matrix, and a six-item list whose relations are not those of the model. Nearest boundary: The semiotic square organizes four logical-semiotic positions around opposition and implication; the concept matrix adds neutral bases and polarized variants in a six-term relational scheme. Exit condition: The analysis fails when inverse or valence assignments are only wordplay, pair relations contradict their definitions, or domain evidence does not support the six distinctions. Common misclassifications: It is not any matrix containing concept labels. It is not identical to the semiotic square. A bar over a term need not mean logical negation. Diagram symmetry is not evidence of semantic validity. Nearest named distinctions: Semiotic square: Uses a different four-term opposition structure. Concept map: Allows arbitrary nodes and labeled relations. Decision matrix: Evaluates options against criteria rather than mapping semiotic variants. Logical hexagon: Extends logical opposition under another formal semantics.
Manages Complexity¶
Six positions generate many pairwise claims whose verbal labels can look persuasive even when their semantics differ. The model makes ambiguity visible but also multiplies opportunities for forced opposition and circular justification.
Abstract Reasoning¶
- Define a neutral concept and a defensible inverse in context.
- Derive positive and negative variants without treating morphology as proof.
- Populate the six positions with consistent definitions.
- Test each prescribed relation against examples and counterexamples.
- Compare the explanatory yield with a semiotic square or simpler concept map.
Knowledge Transfer¶
The six-position syntax transfers across discourses, but the contents, valence, inverse relation, and evidentiary tests must be rebuilt in each domain. A filled template without that work is not a valid transfer.
Relationships to Other Abstractions¶
Current abstraction Matrices of Concepts Domain-specific
Parents (1) — more general patterns this builds on
-
Matrices of Concepts presupposes Schema Prime
Matrices of Concepts presupposes Schema: the parent's defining role is necessary to the child's frozen mechanism or criterion.
Hierarchy path (1) — routes to 1 parentless root
- Matrices of Concepts → Schema → Abstraction
Neighborhood in Abstraction Space¶
Matrices of Concepts sits in a moderately populated region (57th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Logical Connectives & Formal Systems (13 abstractions)
Nearest neighbors
- Free Group — 0.86
- Classical Modal Logic — 0.85
- Logical or — 0.85
- Complex number — 0.85
- Numeral Prefix — 0.85
Computed from structural-signature embeddings · 2026-10-08