Order, Type & Classification Foundations

← Back to Domain-Specific Families

Abstractions that classify mathematical objects up to a declared equivalence or structural rule, spanning binary-relation and order properties such as reflexive relations and interval orders, type-theoretic foundations like identity, unit and intersection types, and representation-theoretic classifications such as partition algebras and indecomposable modules.

49 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Bracket algebra — A quotient algebra encoding projective invariants through bracket symbols over a signed alphabet.
• C-minimal theory — A model-theoretic theory whose definable one-variable sets are finite Boolean combinations of cones determined by a ternary C-relation.
• Category of representations — A category whose objects are representations of a fixed algebraic structure and whose morphisms are equivariant maps.
• Chu space — A three-part relational structure of points, states, and values whose duality and morphisms generalize topological and linear spaces.
• Classification theorem — A theorem enumerating every object of a declared mathematical type up to a stated equivalence, without omission or redundant equivalence classes.
• Compact semigroup — A semigroup whose solution sets for arbitrary systems of word equations are already determined by some finite subsystem, under the algebraic compactness convention.
• Connected relation — A binary relation that compares every pair of distinct elements in at least one direction.
• Container (type theory) — A shape-and-positions representation of strictly positive collection-like type constructors in dependent type theory.
• Duality (order theory) — The order-reversing construction that replaces a partially ordered set by the same elements with every comparison reversed.
• 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.
• Generic filter — A forcing filter that meets every dense subset of a partial order belonging to a specified ground model.
• Generic property — A mathematical property holding outside a negligible exceptional set under a declared measure-theoretic, topological or algebraic notion of genericity.
• Hasse diagram — A drawing of a finite partially ordered set using vertices for elements and upward cover edges while omitting reflexive and transitively implied relations.
• Hermite reciprocity — A representation-theoretic isomorphism exchanging degree and symmetric-power indices for binary forms: Sym^m(Symn V) is isomorphic to Sym^n(Symm V) for two-dimensional V.
• Identity type — A type-theoretic proposition whose inhabitants witness equality between two terms of a type.
• Indecomposable module — A nonzero module that cannot be expressed as a direct sum of two nonzero submodules.
• Intersection type — A type assigned to values satisfying multiple type descriptions simultaneously, written as an intersection such as sigma ∩ tau.
• Interval order — A partial order representable by real intervals where one element precedes another exactly when its interval lies completely to the left.
• Kostant partition function — A function counting the ways a weight can be expressed as a nonnegative integer combination of the positive roots of a root system.
• Law of trichotomy — The order principle that for every two elements exactly one of x<y, x=y or y<x holds, equivalently combining connectedness with asymmetry for a strict order.
• Maximal and minimal elements — Elements of a subset in a preorder that have no strictly greater or strictly lesser comparable member in that subset, without necessarily dominating or being dominated by every member.
• Mouse (set theory) — A small iterable fine-structural model equipped with extender data, used to approximate large-cardinal universes and build core models.
• Multivalued function — A relation assigning each input a set of possible outputs, represented by a subset of the Cartesian product and often equipped with nonempty-value or regularity conditions.
• Murnaghan–Nakayama rule — A signed rim-hook removal rule for computing irreducible character values of symmetric groups from partitions.
• Order type — The isomorphism class of an ordered set under order-preserving bijection, capturing its ordering structure independently of element names.
• Osculant — An invariant that vanishes when hypersurfaces have contact of unusually high order at a common point.
• Partition algebra — An associative diagram algebra whose basis elements are set partitions and whose product concatenates diagrams while weighting closed middle components.
• Partition of a set — A family of nonempty, pairwise disjoint subsets whose union is the whole underlying set, equivalently the classes of an equivalence relation.
• Perpetuant — A stable irreducible covariant in classical invariant theory whose degree–weight space persists once the binary form’s degree exceeds the covariant weight.
• Pluripolar set — A subset of a complex domain contained in the negative-infinity locus of a nontrivial plurisubharmonic function.
• Principal indecomposable module — An indecomposable direct summand of the regular module of a ring, equivalently an indecomposable projective cyclic module under standard hypotheses.
• Pseudoreflection — A finite-order nonidentity linear automorphism whose fixed subspace is a hyperplane.
• Reflexive relation — A binary relation on a set that relates every element of the set to itself.
• Representation ring — The Grothendieck ring of finite-dimensional group representations, with direct sum as addition and tensor product as multiplication.
• Restricted representation — The representation of a subgroup obtained by retaining the same vector space and limiting a group representation to subgroup elements.
• Sign (mathematics) — A positive, negative, or zero classification attached to a real quantity, and by extension a binary orientation or parity factor represented by plus or minus one in typed mathematical structures.
• Single-crossing condition — An ordered-comparison property under which the difference between two functions changes sign at most once and in a fixed direction.
• Soft set — A parameterized family of subsets used to represent attribute-dependent or uncertain classifications.
• Structure (mathematical logic) — A nonempty carrier together with interpretations of the constants, functions and relations in a formal signature.
• Sure-thing principle — A decision principle requiring the same action when it is preferred both conditional on an event and conditional on its complement.
• Symmetric closure — The smallest symmetric relation containing a given binary relation R, equal to the union of R with its converse.
• Symmetric difference — The set operation retaining elements that belong to exactly one of two sets.
• Symmetric relation — A binary relation in which a related pair remains related when its two elements are reversed.
• Theory of conjoint measurement — A representation theory that derives additive numerical scales for interacting attributes from qualitative order relations on their combinations.
• Transfer principle — A theorem or schema carrying all sentences of a specified logical language that hold in one structure to another related structure.
• Type variable — A formal variable ranging over types, enabling polymorphic expressions and quantified type schemes without denoting a mutable runtime storage location.
• Typed lambda calculus — A lambda-calculus formalism assigning types to variables and terms and restricting abstraction and application through typing rules.
• Unit type — A type with exactly one inhabitant up to equality, carrying no information beyond successful presence or completion.
• Witness set — A set of input points whose labeled values distinguish one Boolean function or concept from every rival in a declared class.