Part 2: BOUNDARY-NAIVE SET THEORY
Section 9: Formal Properties and Theorems
Pendry, S
Halfhuman Draft
2026
Previous Sections
Post Zero Link
Section 8: Conditional Complement: Validity-Gated Operations

9.1 Complete BNST Axiom System

Axiom 1 (Universal Set):

∃U: ∀x(x ∈ U)

There exists a universal set containing all objects.

Axiom 2 (Unrestricted Comprehension):

∀P: ∃S: ∀x(x ∈ S ↔ P(x))

For any property P, the collection { x | P(x) } exists as a set.

Axiom 3 (Self-Membership Allowed):

(A ∈ A) is syntactically and semantically valid

Sets may contain themselves without restriction.

Axiom 4 (Boundary Complement):

∀A: -A = U \ A (when defined)

The complement of A is everything except A.

Axiom 5 (Russell Boundary Set):

R = -{ x | x ∈ x }

The Russell boundary set contains all non-self-containing objects.

Axiom 6 (Validity Predicate):

∀m: Valid(m) ⟺ m ∈ R

An object is valid iff it doesn’t self-contain.

Axiom 7 (Conditional Complement):

∀A: -A exists ⟺ Valid(op(-A))

Complement operations are defined only if valid.

9.2 Fundamental Theorems

Theorem 9.1 (Existence-Validity Separation):

Existence and validity are independent properties.

∃A: A exists ∧ ¬Valid(A)

Proof:

R = -{ x | x ∈ x } exists (by Axiom 2, 4, 5).

Valid(R) ⟺ R ∈ R (by Axiom 6).

But R ∈ R ⟺ R ∉ R (Russell’s Paradox).

Therefore Valid(R) is undecidable.

Thus R exists but is not determinately valid. ∎

Theorem 9.2 (Paradox Localization):

Contradiction in object m does not propagate to objects independent of m.

Proof sketch:

Let m be boundary-unstable (e.g., R).

Let A be a set independent of m (m does not appear in definition of A).

Membership questions about A depend only on A’s definition.

m’s instability is confined to queries involving m.

Therefore contradiction localizes to m. ∎

Theorem 9.3 (Non-Explosion):

From A ∧ ¬A (for boundary-unstable A), not everything follows.

Proof:

Suppose A ∈ A ∧ A ∉ A (e.g., A = R).

In classical logic: (P ∧ ¬P) → Q (principle of explosion).

But in BNST, A ∈ A and A ∉ A are not classical propositions.

They are boundary conditions expressing instability.

Logical operators don’t apply classically to boundary-unstable objects.

Therefore explosion doesn’t occur. ∎

This is not paraconsistent logic in the traditional sense it’s boundary semantics.

Theorem 9.4 (Complement Involution):

For all sets A where -A exists:

-(-A) = A

Proof:

-(-A) = -(U \ A) = U \ (U \ A) = A (by set algebra) ∎

Theorem 9.5 (De Morgan’s Laws):

For sets A, B where complements exist:

-(A ∪ B) = (-A) ∩ (-B)

-(A ∩ B) = (-A) ∪ (-B)

Proof: Standard set-theoretic proofs apply. ∎

Theorem 9.6 (Validity Monotonicity):

If Valid(A) and A ⊆ B (in non-circular way), then validity of B depends on elements added.

Formal statement: Validity doesn’t propagate automatically through subsets.

Consequence: Must check validity for each construction individually.

9.3 Boundary-Stability Classifications

Definition 9.1 (Boundary-Stable Sets):

A set A is boundary-stable iff:

A ∈ A has determinate truth value

Examples:

  • ∅ is boundary-stable (∅ ∉ ∅)
  • {1, 2, 3} is boundary-stable
  • { x | x is even } is boundary-stable

Definition 9.2 (Boundary-Unstable Sets):

A set A is boundary-unstable iff:

A ∈ A ↔ A ∉ A

Examples:

  • R = -{ x | x ∈ x } is boundary-unstable
  • Any set defined as -A where A contains -A is boundary-unstable

Theorem 9.7 (Stability Decidability):

For explicitly defined finite sets, boundary stability is decidable.

Proof sketch:

Finite sets have explicit element listings.

Membership is checkable by enumeration.

Self-membership reduces to finite check.

Therefore stability is decidable. ∎

Theorem 9.8 (Unstable Sets are Denumerable):

The class of boundary-unstable sets is at most denumerable.

Proof sketch:

Boundary-unstable sets require self-reference in definition.

Self-referencing definitions form a recursively enumerable class.

Therefore boundary-unstable sets are at most countably infinite. ∎

Consequence: “Almost all” sets in BNST are boundary-stable. Instability is rare.

9.4 Operations on Boundary-Unstable Sets

Question: How do standard operations behave when applied to boundary-unstable sets?

Theorem 9.9 (Union Stability):

If A is boundary-stable and B is boundary-stable, then A ∪ B is boundary-stable.

Proof:

(A ∪ B) ∈ (A ∪ B) requires:

(A ∪ B) ∈ A ∨ (A ∪ B) ∈ B

Both sides involve stable sets.

Therefore (A ∪ B) ∈ (A ∪ B) has determinate value. ∎

Theorem 9.10 (Complement Stability Transfer):

If A is boundary-stable and -A exists, then -A may be unstable.

Counter-example:

Let S = { x | x ∈ x }.

S is boundary-stable (self-membership for any x is determinate).

But -S = R is boundary-unstable.

Therefore stability doesn’t transfer through complement. ∎

Practical guidance: Operations on stable sets usually produce stable results, except complement which requires separate validity check.

9.5 Comparison Theorems

Theorem 9.11 (BNST vs ZFC):

Every theorem provable in ZFC is provable in BNST when restricted to boundary-stable sets.

Proof sketch:

ZFC operations (without self-containing sets) are subset of BNST.

Boundary-stable sets behave classically.

Therefore ZFC theorems hold for stable subdomain. ∎

Consequence: BNST is conservative extension of ZFC for normal mathematics.

Theorem 9.12 (BNST Expressive Power):

BNST can express constructions impossible in ZFC.

Examples:

  • Universal set U
  • Russell set R
  • Self-containing sets explicitly

Therefore: BNST > ZFC in expressive power.

9.6 Limitations and Open Questions

Open Problem 9.1 (Consistency Strength):

What is the consistency strength of BNST relative to standard systems?

Hypothesis: BNST is consistent if naive set theory without paradoxes is consistent.

Open Problem 9.2 (Completeness):

Is BNST complete for boundary-stable sets?

Open Problem 9.3 (Computational Complexity):

What is the computational complexity of:

  • Checking boundary stability?
  • Validating complement operations?
  • Determining membership for boundary-unstable sets?

Open Problem 9.4 (Model Theory):

What models satisfy BNST axioms? How do they relate to models of ZFC?

9.7 Summary of Formal Properties

What BNST achieves:

  • Consistent treatment of paradoxical sets
  • Localization of contradiction
  • No logical explosion
  • Natural stratification
  • Conservative extension of ZFC for stable domain

What BNST provides:

  • Formal tools for self-reference
  • Validity checking framework
  • Boundary semantics for paradox
  • Unrestricted comprehension preserved

What remains open:

  • Full consistency proof
  • Computational complexity results
  • Complete model theory
  • Applications beyond set theory
Previous Sections
Post Zero Link
Section 8: Conditional Complement: Validity-Gated Operations
Next up
Part 2: BOUNDARY-NAIVE SET THEORY
Section 10: Comparison to Existing Approaches

© 2026 HalfHuman Draft - Pendry, S
This post is licensed under Creative Commons Attribution 4.0 (CC BY 4.0).
Code examples (if any) are licensed under the Apache License, Version 2.0

See /license for details.