Back to Random stuff

Moral philosophy: logical classification

Every philosophy record is a visible node. Solid branches implement sourced local classifications. Dashed branches index cross-cutting records without falsely calling them exclusive classes.

Rule of construction

Let S(v) be the classification children of a node v. Define one discriminator fv: S(v) → Vv. Require distinct members of S(v) to have distinct values. The remaining children I(v) use an indexed-under edge. They are visible navigation placements and are not asserted to be mutually exclusive subtypes.

Method: SEP supports each local classification. Indexed attachments preserve thinkers, concepts, methods, and theories that cross more than one coordinate. No single SEP article asserts the entire map.

SEP basis: Moral Phenomenology distinguishes second-order metaethics from first-order normative ethics, then divides normative ethics into general theory and applied inquiry. Moral Theory explains why several familiar theory families are useful but rough. Rough and cross-cutting records remain visible through dashed indexing edges.

Complete classification and index tree

A solid child shows a discriminator value. A dashed child shows its record type.

Select a box to open or close its branch. Solid edge = classification. Dashed edge = indexed placement. Keyboard: ↑ parent, ↓ child, ← → siblings.

Swipe sideways to see the rest of a wide branch.

Moral philosophy: logical classification

SEP

Definition

Explanation

Examples
Objections
SEP references