Scott–Potter set theory¶

Build set theory from a cumulative hierarchy of levels and histories, treating sets as subcollections of levels while allowing urelements and avoiding a primitive iterative-stage ontology.

Version: v1 · 2026-09-08 · History
Domain-specific #: 6602
Origin domain: foundations of mathematics
Subdomain: axiomatic set theory
Aliases: Potter set theory

Core Idea¶

Scott–Potter set theory is a family of nested axiomatic theories, developed from Dana Scott's approach by Michael Potter, in which the cumulative hierarchy is described through histories and levels and sets are subcollections of levels. Creation supplies ever higher levels; separation forms definable subcollections within a level; additional infinity, choice, or replacement-like principles strengthen the base theory. Birthdays locate sets in the hierarchy and support ordinary arithmetic and relation theory. 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.

Scope of Application¶

Scott–Potter set theory belongs to foundations of mathematics and is useful where the analyst can specify a first-order universe of urelements and collections equipped with membership, accumulations, histories, levels, and separation principles, then evaluate membership and set formation obey the stated history-and-level axioms, with every set contained in a level and each claimed mathematical construction justified in the selected theory variant. The scope is broad within that domain but bounded by the need for membership and set formation obey the stated history-and-level axioms, with every set contained in a level and each claimed mathematical construction justified in the selected theory variant. 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 membership and set formation obey the stated history-and-level axioms, with every set contained in a level and each claimed mathematical construction justified in the selected theory variant the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

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 Scott–Potter set theory. Scott–Potter set theory 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 first-order universe of urelements and collections equipped with membership, accumulations, histories, levels, and separation principles. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express membership and set formation obey the stated history-and-level axioms, with every set contained in a level and each claimed mathematical construction justified in the selected theory variant independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of foundations of mathematics because they reuse a first-order universe of urelements and collections equipped with membership, accumulations, histories, levels, and separation principles, Creation supplies ever higher levels; separation forms definable subcollections within a level; additional infinity, choice, or replacement-like principles strengthen the base theory. Birthdays locate sets in the hierarchy and support ordinary arithmetic and relation theory., and type the carrier, state every parameter and convention in the definition, test that membership and set formation obey the stated history-and-level axioms, with every set contained in a level and each claimed mathematical construction justified in the selected theory variant, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Scott–Potter set theory Domain-specific

Parents (1) — more general patterns this builds on

Scott–Potter set theory is a kind of Formalization Prime

The proposed strict upward parent is prime:formalization.

Hierarchy paths (2) — routes to 2 parentless roots

Scott–Potter set theory → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Scott–Potter set theory sits in a moderately populated region (40^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Set Theory & Constructive Foundations (15 abstractions)

Nearest neighbors

Universal set — 0.90
Zermelo set theory — 0.90
Von Neumann–Bernays–Gödel set theory — 0.90
Club principle — 0.89
Finite set — 0.89

Computed from structural-signature embeddings · 2026-09-08