The Truth Inside One

At a glance

Within the supplied two-stage presheaf category, the three subobjects of the terminal presheaf—the three global truth values—are

always in the order (𝑊,𝑁). They form the chain

Their negations are

Consequently,

so excluded middle fails in this internal logic. Also,

Key idea: compatibility removes the classical complement

The two stages are not independent switches. A whole-stage mark must restrict to a narrow-stage mark. Of the four raw present-or-absent pairs, exactly one violates this rule—and that forbidden pair is precisely the stagewise complement that 𝐿 would need in a two-valued Boolean logic.

1. Prove terminality

Let 𝐹 be any presheaf

There is exactly one possible function from either component set to a singleton:

For every 𝑥 ∈𝐹(𝑊), the two sides of the restriction equation are

and

Thus the component functions respect restriction. They are the only possible component functions, so there is exactly one presheaf map 𝐹 →𝟏. Therefore 𝟏 is terminal.

2. Check every raw pair

The third row fails because its whole-stage ⋆ must restrict to ⋆ at the narrow stage, but its narrow subset does not contain ⋆.

This is a complete enumeration. Each stage has exactly two possible subsets of its singleton, so there are only

raw pairs. The table checks all four.

3. Order the valid values

Stagewise inclusion gives

With the required names, this is

4. Rule out the apparent complement

Flipping presence and absence in 𝐿 =(∅,{ ⋆}) gives

This pair contains ⋆ at 𝑊, so restriction sends that mark to ⋆ at 𝑁. The narrow component is empty and does not contain the restricted mark. Therefore the pair is not a subpresheaf and is not a valid global truth value.

The missing fourth pair is exactly the classical-looking complement that compatibility forbids.

5. Compute negation

Negation is the largest valid value disjoint from the given value.

For 0, every global truth value is disjoint from 0, and the largest is 1. Hence

For 𝐿,

but

Only 0 is disjoint from 𝐿, so

Finally, 1 ∧𝑄 =𝑄 for every global truth value 𝑄. Only 𝑄 =0 gives meet 0. Thus

6. Test excluded middle

For the three possible values,

Because 𝐿 ≠1, the value 𝐿 disproves the internal law

for every 𝑃. Thus this internal logic is not Boolean.

7. Test double negation

Since ¬𝐿 =0,

But 𝐿 ≠1. Therefore

so double-negation elimination also fails internally.

Check against the definitions

The terminality proof supplied the unique compatible map from an arbitrary presheaf. The subobject table checked every possible pair and enforced the restriction condition. Each logical operation was then computed only among the three global values. The conclusion concerns the category’s internal law, not the external classical reasoning used to establish it.

Another facet

The three values form the three-element Heyting chain Sub⁡(𝟏), the algebra of global truth values of the presheaf topos on the arrow 𝑁 →𝑊. The full truth-value presheaf is not constant: it has three values at 𝑊 and two at 𝑁. The same local-versus-whole pattern appears in the Sierpiński space, whose open sets are empty, narrow-only, and whole.

This conclusion is model-specific. It does not say that every presheaf category, every part of the Manyfold, or the ordinary logic used in this solution has exactly three truth values.

Teaching notes

• Keep every ordered pair in the order (𝑊,𝑁).
• Do not call 𝐿 simply false. It holds at the narrow stage but not at the whole stage.
• Internal negation is the largest valid disjoint global truth value, not a componentwise set complement.
• The strongest conceptual check is to ask why the one missing pair is also the complement that 𝐿 would need.