DEF0284canonicalv1Five Forbidden Moves
Five operations ZFC allows but τ forbids: (1) unbounded fan-out (K3), (2) global equality (K5), (3) succinct circuits (operational closure), (4) exponential quantification (observation-finiteness), (5) non-local disguise (NF uniqueness). Each has a specific bridge consequence.
Payload
Five Forbidden Moves
Five operations ZFC allows but τ forbids: (1) unbounded fan-out (K3), (2) global equality (K5), (3) succinct circuits (operational closure), (4) exponential quantification (observation-finiteness), (5) non-local disguise (NF uniqueness). Each has a specific bridge consequence.
Five Forbidden Moves
Summary
Five operations ZFC allows but τ forbids: (1) unbounded fan-out (K3), (2) global equality (K5), (3) succinct circuits (operational closure), (4) exponential quantification (observation-finiteness), (5) non-local disguise (NF uniqueness). Each has a specific bridge consequence.
Statement
\label{def:five-forbidden-moves}
The following five \emph{forbidden moves} are operations admitted
by ZFC but prohibited by Category~$\T$.
\begin{enumerate}
\item \textbf{Unbounded fan-out.}
\emph{ZFC}: Power Set.
\emph{$\T$~block}: $\KAxiom{3}$ (bounded multiplicity).
\emph{Bridge}: brute-force search over $\mathcal{P}(X)$
unavailable; the NP-hardness gap.
\item \textbf{Global equality.}
\emph{ZFC}: Extensionality.
\emph{$\T$~block}: $\KAxiom{5}$ (diagonal discipline).
\emph{Bridge}: diagonal arguments (Cantor, Russell)
have no $\T$-analogue; equality is local and earned.
\item \textbf{Succinct circuits.}
\emph{ZFC}: Replacement.
\emph{$\T$~block}: operational closure finiteness.
\emph{Bridge}: some ZFC-compressible objects have no
$\T$-short description; the compression gap.
\item \textbf{Exponential quantification.}
\emph{ZFC}: unrestricted quantification over
uncountable sets.
\emph{$\T$~block}: observation finiteness.
\emph{Bridge}: exponential-witness searches trivially
resolve in~$\T$; the witness gap.
\item \textbf{Non-local disguise.}
\emph{ZFC}: Foundation + Replacement (re-encoding).
\emph{$\T$~block}: NF uniqueness.
\emph{Bridge}: encoding tricks that shift complexity
cannot operate in~$\T$; the disguise gap.
\end{enumerate}
Proof / Justification
This item is definitional. No manuscript proof is required.
Source Context
- Registry source:
book-03.jsonlline 172 - Manuscript source:
2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part10/ch65-the-five-forbidden-moves.texlines 49-86
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookIII.Bridge.ForbiddenMoves - Name:
forbidden_moves_check
Dependencies
- Canonical: III.D67
Related Results
Generated by later projection phases.
Related Publications
Generated by later projection phases.
Revision Notes
- 2026-04-24: Initial pilot migration.
Identifiers
Aliases & legacy IDs
III.D69five-forbidden-movesdef:five-forbidden-movesRelease lines
corpus_v3_workingcorpus_v2Relations
Formalized by (6)
Appears in (1)
Downstream uses (computed) (12)
Items in the corpus that reference this one via load-bearing relations. Computed from the full corpus-v3 graph at build time.
FTH0477formal theorem
FTH0477formal theorem
FTH0480formal theorem
FTH0480formal theorem
FTH0481formal theorem
FTH0481formal theorem
FTH0482formal theorem
FTH0482formal theorem
FTH0483formal theorem
FTH0483formal theorem
FTH0487formal theorem
FTH0487formal theoremSources
Version & History
Status disclaimer
A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.