DEF0290canonicalv1E₂→E₃ Boundary Crossing
An operation that (i) originates at E₂ with self-referential codes, (ii) requires determining a host-level property of the entire code space, (iii) resides at E₃ because it demands self-modelling. The paradox is the error message when E₂ self-reference hits the E₃ wall.
Payload
E₂→E₃ Boundary Crossing
An operation that (i) originates at E₂ with self-referential codes, (ii) requires determining a host-level property of the entire code space, (iii) resides at E₃ because it demands self-modelling. The paradox is the error message when E₂ self-reference hits the E₃ wall.
E₂→E₃ Boundary Crossing
Summary
An operation that (i) originates at E₂ with self-referential codes, (ii) requires determining a host-level property of the entire code space, (iii) resides at E₃ because it demands self-modelling. The paradox is the error message when E₂ self-reference hits the E₃ wall.
Statement
%
\label{def:e2-e3-boundary-crossing}
An \textbf{$\Elayer{2} \to \Elayer{3}$ boundary crossing}
is an operation satisfying:
\begin{enumerate}
\item \textbf{Origin at $\Elayer{2}$.}
The operation begins within an $\Elayer{2}$ virtual machine
(Definition~\ref{def:zfc-as-e2-vm})
and uses self-referential codes.
\item \textbf{Self-modelling requirement.}
The operation requires determining a property
of the \emph{entire} code space
that is a host-level property
(Definition~\ref{def:host-level-property}).
\item \textbf{$\Elayer{3}$ residence.}
The determination presupposes an observer
who models the observation process itself
(Definition~\ref{def:proof-theory-as-e3}).
No $\Elayer{2}$ code can perform it.
\end{enumerate}
The \emph{paradox} is the error message ---
contradiction, undecidability, or impossibility ---
produced when the $\Elayer{2}$ agent
attempts the $\Elayer{3}$ operation anyway.
Proof / Justification
This item is definitional. No manuscript proof is required.
Source Context
- Registry source:
book-03.jsonlline 186 - Manuscript source:
2nd-edition/book-iii-categorical-spectrum/02_mainmatter/part10/ch71-four-paradoxes-as-boundary-crossings.texlines 50-75
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookIII.Mirror.ProofTheoryE3 - Name:
four_paradox_check
Dependencies
- Canonical: III.D73, III.D70, 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.D75e-e-boundary-crossingdef:e2-e3-boundary-crossingRelease 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.
FTH0644formal theorem
FTH0644formal theorem
FTH0645formal theorem
FTH0645formal theorem
FTH0649formal theorem
FTH0649formal theorem
FTH0650formal theorem
FTH0650formal theorem
FTH0651formal theorem
FTH0651formal theorem
FTH0652formal theorem
FTH0652formal 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.