Inhalt
Aktueller Ordner:
/modal5_teil4_auferstehung_en.tex
% Options for packages loaded elsewhere
\PassOptionsToPackage{unicode}{hyperref}
\PassOptionsToPackage{hyphens}{url}
\documentclass[
]{article}
\usepackage{xcolor}
\usepackage{amsmath,amssymb}
\setcounter{secnumdepth}{-\maxdimen} % remove section numbering
\usepackage{iftex}
\ifPDFTeX
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{textcomp} % provide euro and other symbols
\else % if luatex or xetex
\usepackage{unicode-math} % this also loads fontspec
\defaultfontfeatures{Scale=MatchLowercase}
\defaultfontfeatures[\rmfamily]{Ligatures=TeX,Scale=1}
\fi
\usepackage{lmodern}
\ifPDFTeX\else
% xetex/luatex font selection
\fi
% Use upquote if available, for straight quotes in verbatim environments
\IfFileExists{upquote.sty}{\usepackage{upquote}}{}
\IfFileExists{microtype.sty}{% use microtype if available
\usepackage[]{microtype}
\UseMicrotypeSet[protrusion]{basicmath} % disable protrusion for tt fonts
}{}
\makeatletter
\@ifundefined{KOMAClassName}{% if non-KOMA class
\IfFileExists{parskip.sty}{%
\usepackage{parskip}
}{% else
\setlength{\parindent}{0pt}
\setlength{\parskip}{6pt plus 2pt minus 1pt}}
}{% if KOMA class
\KOMAoptions{parskip=half}}
\makeatother
\setlength{\emergencystretch}{3em} % prevent overfull lines
\providecommand{\tightlist}{%
\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}
\usepackage{bookmark}
\IfFileExists{xurl.sty}{\usepackage{xurl}}{} % add URL line breaks if available
\urlstyle{same}
\hypersetup{
pdftitle={The Resurrection as Theorem},
pdfauthor={Paul Koop},
hidelinks,
pdfcreator={LaTeX via pandoc}}
\title{The Resurrection as Theorem}
\usepackage{etoolbox}
\makeatletter
\providecommand{\subtitle}[1]{% add subtitle to \maketitle
\apptocmd{\@title}{\par {\large #1 \par}}{}{}
}
\makeatother
\subtitle{Modal 5, Part IV --- Explained in the Style of a Chess
Journalist}
\author{Paul Koop}
\date{}
\begin{document}
\maketitle
\section{Preliminary Note: How to Read This
File}\label{preliminary-note-how-to-read-this-file}
This file explains \textbf{Part IV} of Modal 5: the resurrection as a
theorem from the axioms A16--A20. It is written in the \textbf{same
style} as the previous files: move by move, with symbol explanation at
every step, with plain language for every statement.
\textbf{What is presupposed:} The first file Modal 5 should have been
read. In particular, the tableau rules and the superposition axioms
ASP3--ASP5 are presupposed as known.
\textbf{What this file achieves:} It shows that the resurrection is
\textbf{not an additional axiom}, but a \textbf{theorem} from A16--A20.
It also shows, however, that A16--A20 are \textbf{strong} axioms --- and
that Modal 10 later finds weaker principles (U1--U3).
\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}
\section{Part IV --- The Resurrection as
Theorem}\label{part-iv-the-resurrection-as-theorem}
\subsection{1. The Axioms A16--A20}\label{the-axioms-a16a20}
\textbf{The five axioms in formula notation:}
\begin{verbatim}
A16 βc (Consciousness(c) β integrated(c,S))
A17 βc (Knowledge(c,S) β integrated(c,S))
A18 β‘βI (Existence(I) β Conservation(I))
A19 βc (Death(c) β Integration(c,S))
A20 βc (Knowledge(c,S) β Existence(c))
\end{verbatim}
\textbf{Symbol explanation:}
\begin{itemize}
\tightlist
\item
\texttt{βc}: ``for all consciousnesses c'' (universal quantifier over
consciousnesses).
\item
\texttt{βI}: ``for all individuals I'' (universal quantifier over
individuals).
\item
\texttt{β}: ``if \ldots{} then \ldots{}'' (implication).
\item
\texttt{β}: ``if and only if'' (equivalence).
\item
\texttt{β‘}: ``necessarily'' (necessity operator).
\item
\texttt{Consciousness(c)}: predicate ``c is a consciousness''.
\item
\texttt{integrated(c,S)}: predicate ``c is integrated into S''.
\item
\texttt{Knowledge(c,S)}: predicate ``c knows about S''.
\item
\texttt{Existence(I)}: predicate ``I exists''.
\item
\texttt{Conservation(I)}: predicate ``I is conserved''.
\item
\texttt{Death(c)}: predicate ``c is dead''.
\item
\texttt{Integration(c,S)}: predicate ``c is integrated into S''
(stronger than \texttt{integrated}).
\end{itemize}
\textbf{In plain language:}
\begin{itemize}
\tightlist
\item
\textbf{A16:} All consciousnesses are integrated into S.
\item
\textbf{A17:} Knowledge of S and integration into S are equivalent.
\item
\textbf{A18:} All existence is conserved (unitarity).
\item
\textbf{A19:} Death is integration into S.
\item
\textbf{A20:} Knowledge of S and existence are equivalent.
\end{itemize}
\textbf{Together:} Consciousness β integration into S β resurrection.
\subsection{2. The Theorem}\label{the-theorem}
\textbf{Goal:} Show that the resurrection is derivable from A16--A20.
\textbf{Formally:}
\begin{verbatim}
S5+SP+U β’ β‘βc (Consciousness(c) β Resurrection(c))
\end{verbatim}
\textbf{Symbol explanation:}
\begin{itemize}
\tightlist
\item
\texttt{β’}: ``is derivable''.
\item
\texttt{S5+SP+U}: the system of S5, superposition axioms, and
A16--A20.
\item
\texttt{Resurrection(c)}: the predicate ``c is resurrected''.
\end{itemize}
\textbf{In plain language:} In the system of S5, superposition axioms,
and A16--A20, it is derivable: For every consciousness c, necessarily:
If c is a consciousness, then c is resurrected.
\subsection{3. The Tableau Proof Move by
Move}\label{the-tableau-proof-move-by-move}
\subsubsection{Move 1}\label{move-1}
\begin{verbatim}
BOARD (empty β the tableau begins)
MOVE Assumption: Β¬β‘βc (Consciousness(c) β Resurrection(c))
SYMBOLS Β¬ = not; β‘ = necessary; βc = for all c;
β = if-then; Resurrection = the predicate
WHY This is the negation of the target formula. We want to show
that it is untenable β so we assume it is tenable.
PLAIN "It is not necessary that all consciousnesses are
resurrected."
NEW Line 1: Β¬β‘βc (Consciousness(c) β Resurrection(c))
\end{verbatim}
\subsubsection{Move 2}\label{move-2}
\begin{verbatim}
BOARD Line 1: Β¬β‘βc (Consciousness(c) β Resurrection(c))
MOVE Apply Β¬β‘-rule
SYMBOLS Β¬β‘A β βΒ¬A (rule)
β = possible
WHY The formula has the form Β¬β‘A. The only applicable rule is
the Β¬β‘-rule.
PLAIN "It is possible that not all consciousnesses are
resurrected."
NEW Line 2: βΒ¬βc (Consciousness(c) β Resurrection(c))
\end{verbatim}
\subsubsection{Move 3}\label{move-3}
\begin{verbatim}
BOARD Line 2: βΒ¬βc (Consciousness(c) β Resurrection(c))
MOVE Apply β-rule
SYMBOLS βA β A @w_new (rule)
@w_new = in a new world
WHY The formula has the form βA. The β-rule creates a new
world w0.
PLAIN "In a new world w0: not all consciousnesses are
resurrected."
NEW Line 3: Β¬βc (Consciousness(c) β Resurrection(c)) @w0
\end{verbatim}
\subsubsection{Move 4}\label{move-4}
\begin{verbatim}
BOARD Line 3: Β¬βc (Consciousness(c) β Resurrection(c)) @w0
MOVE Apply Β¬β-rule
SYMBOLS Β¬βc A β βc Β¬A (rule)
βc = there is a c
WHY The formula has the form Β¬βc A. The Β¬β-rule makes it
βc Β¬A.
PLAIN "There is a consciousness c for which in w0: c is not
resurrected."
NEW Line 4: βc Β¬(Consciousness(c) β Resurrection(c)) @w0
\end{verbatim}
\subsubsection{Move 5}\label{move-5}
\begin{verbatim}
BOARD Line 4: βc Β¬(Consciousness(c) β Resurrection(c)) @w0
MOVE Apply β-rule
SYMBOLS βc A β A[a/c] (rule)
a = a new individual
WHY The formula has the form βc A. The β-rule introduces a new
individual a.
PLAIN "For a particular consciousness a, in w0: a is not
resurrected."
NEW Line 5: Β¬(Consciousness(a) β Resurrection(a)) @w0
\end{verbatim}
\subsubsection{Move 6}\label{move-6}
\begin{verbatim}
BOARD Line 5: Β¬(Consciousness(a) β Resurrection(a)) @w0
MOVE Apply Β¬β-rule
SYMBOLS Β¬(A β B) β A, Β¬B (rule)
WHY The formula has the form Β¬(A β B). The Β¬β-rule decomposes
it into A and Β¬B.
PLAIN "Both hold: a is a consciousness, and a is not
resurrected."
NEW Line 6: Consciousness(a) @w0
Line 7: Β¬Resurrection(a) @w0
\end{verbatim}
\subsubsection{Move 8 --- Apply A16}\label{move-8-apply-a16}
\begin{verbatim}
BOARD Line 6: Consciousness(a) @w0
MOVE Apply A16 (β‘-rule, then β-rule)
SYMBOLS A16 := βc (Consciousness(c) β integrated(c,S))
β‘-rule: β‘A @w β A @v
β-rule: βc A β A[a/c]
WHY A16 is available as a formula. The β‘-rule makes it
βc (Consciousness(c) β integrated(c,S)) @w0. The β-rule
makes it Consciousness(a) β integrated(a,S) @w0.
PLAIN "From A16: If a is a consciousness, then a is integrated
into S."
NEW Line 8: Consciousness(a) β integrated(a,S) @w0
\end{verbatim}
\subsubsection{Move 9 --- Modus Ponens}\label{move-9-modus-ponens}
\begin{verbatim}
BOARD Line 6: Consciousness(a) @w0
Line 8: Consciousness(a) β integrated(a,S) @w0
MOVE Apply Modus Ponens
SYMBOLS from A and A β B follows B
WHY We have A (Line 6) and A β B (Line 8). So B follows.
PLAIN "So: a is integrated into S."
NEW Line 9: integrated(a,S) @w0
\end{verbatim}
\subsubsection{Move 10 --- Apply A19}\label{move-10-apply-a19}
\begin{verbatim}
BOARD (A19 is available)
MOVE Apply A19 (β‘-rule, then β-rule, then β-rule)
SYMBOLS A19 := βc (Death(c) β Integration(c,S))
β-rule: A β B β Β¬A | B
WHY A19 is available as a formula. The β‘-rule and β-rule make
it Death(a) β Integration(a,S) @w0. The β-rule branches
into Β¬Death(a) | Integration(a,S).
PLAIN "From A19: If a is dead, then a is integrated into S.
So: Either a is not dead, or a is integrated into S."
NEW Branching:
10a: Β¬Death(a) @w0
10b: Integration(a,S) @w0
We choose 10b (consistent with Line 9).
\end{verbatim}
\subsubsection{Move 11 --- Apply A20}\label{move-11-apply-a20}
\begin{verbatim}
BOARD (A20 is available)
MOVE Apply A20 (β‘-rule, then β-rule)
SYMBOLS A20 := βc (Knowledge(c,S) β Existence(c))
β-rule: A β B β (A β B) β§ (B β A)
WHY A20 is available as a formula. The β‘-rule and β-rule make
it Knowledge(a,S) β Existence(a) @w0. The β-rule
decomposes it into two implications.
PLAIN "From A20: a knows about S if and only if a exists.
So: (a knows about S β a exists) and
(a exists β a knows about S)."
NEW Line 11: Knowledge(a,S) β Existence(a) @w0
Line 12: Existence(a) β Knowledge(a,S) @w0
\end{verbatim}
\subsubsection{Move 13 --- Apply A17}\label{move-13-apply-a17}
\begin{verbatim}
BOARD Line 9: integrated(a,S) @w0
MOVE Apply A17 (β‘-rule, then β-rule)
SYMBOLS A17 := βc (Knowledge(c,S) β integrated(c,S))
β-rule: A β B β (A β B) β§ (B β A)
WHY A17 is available as a formula. The β‘-rule and β-rule make
it Knowledge(a,S) β integrated(a,S) @w0. The β-rule
decomposes it into two implications.
PLAIN "From A17: a knows about S if and only if a is integrated
into S. So: (a integrated into S β a knows about S) and
(a knows about S β a integrated into S)."
NEW Line 13: integrated(a,S) β Knowledge(a,S) @w0
Line 14: Knowledge(a,S) β integrated(a,S) @w0
\end{verbatim}
\subsubsection{Move 15 --- Modus Ponens}\label{move-15-modus-ponens}
\begin{verbatim}
BOARD Line 9: integrated(a,S) @w0
Line 13: integrated(a,S) β Knowledge(a,S) @w0
MOVE Apply Modus Ponens
SYMBOLS from A and A β B follows B
WHY We have A (Line 9) and A β B (Line 13). So B follows.
PLAIN "So: a knows about S."
NEW Line 15: Knowledge(a,S) @w0
\end{verbatim}
\subsubsection{Move 16 --- Modus Ponens}\label{move-16-modus-ponens}
\begin{verbatim}
BOARD Line 15: Knowledge(a,S) @w0
Line 11: Knowledge(a,S) β Existence(a) @w0
MOVE Apply Modus Ponens
SYMBOLS from A and A β B follows B
WHY We have A (Line 15) and A β B (Line 11). So B follows.
PLAIN "So: a exists."
NEW Line 16: Existence(a) @w0
\end{verbatim}
\subsubsection{Move 17 --- Apply A18}\label{move-17-apply-a18}
\begin{verbatim}
BOARD Line 16: Existence(a) @w0
MOVE Apply A18 (β‘-rule, then β-rule)
SYMBOLS A18 := β‘βI (Existence(I) β Conservation(I))
β‘-rule: β‘A @w β A @v
β-rule: βI A β A[a/I]
WHY A18 is available as a β‘-formula. The β‘-rule makes it
βI (Existence(I) β Conservation(I)) @w0. The β-rule makes
it Existence(a) β Conservation(a) @w0.
PLAIN "From A18: If a exists, then a is conserved."
NEW Line 17: Existence(a) β Conservation(a) @w0
\end{verbatim}
\subsubsection{Move 18 --- Modus Ponens}\label{move-18-modus-ponens}
\begin{verbatim}
BOARD Line 16: Existence(a) @w0
Line 17: Existence(a) β Conservation(a) @w0
MOVE Apply Modus Ponens
SYMBOLS from A and A β B follows B
WHY We have A (Line 16) and A β B (Line 17). So B follows.
PLAIN "So: a is conserved."
NEW Line 18: Conservation(a) @w0
\end{verbatim}
\subsubsection{Move 19 --- Insert definition
Resurrection}\label{move-19-insert-definition-resurrection}
\begin{verbatim}
BOARD Line 10b: Integration(a,S) @w0
Line 18: Conservation(a) @w0
MOVE Insert definition Resurrection
SYMBOLS Resurrection(a) := Integration(a,S) β§ Conservation(a)
β§ = and
WHY The definition of resurrection is the conjunction of
integration and conservation. Both are given in Line 10b
and 18.
PLAIN "a is resurrected because a is integrated into S and
conserved."
NEW Line 19: Resurrection(a) @w0
\end{verbatim}
\subsubsection{Move 20 --- Contradiction}\label{move-20-contradiction}
\begin{verbatim}
BOARD Line 7: Β¬Resurrection(a) @w0
Line 19: Resurrection(a) @w0
MOVE Detect contradiction
SYMBOLS β₯ = contradiction
WHY Β¬Resurrection(a) and Resurrection(a) cannot hold
simultaneously.
PLAIN "Contradiction: a is resurrected and a is not
resurrected."
NEW β₯ β the tableau closes.
\end{verbatim}
\subsubsection{Final Result}\label{final-result}
\begin{verbatim}
BOARD All branches close.
PLAIN The assumption Β¬β‘βc (Consciousness(c) β Resurrection(c))
is untenable.
RESULT β‘βc (Consciousness(c) β Resurrection(c)) is derivable.
FORMAL S5+SP+U β’ β‘βc (Consciousness(c) β Resurrection(c))
\end{verbatim}
\textbf{The resurrection is a theorem from A16--A20.}
\subsection{4. What the Proof Shows --- and What It Does
Not}\label{what-the-proof-shows-and-what-it-does-not}
\textbf{What the proof shows:}
\begin{itemize}
\tightlist
\item
The resurrection follows \textbf{necessarily} from A16--A20.
\item
It is \textbf{not} an additional axiom --- it is a \textbf{theorem}.
\item
It holds for \textbf{all} consciousnesses (not only for ``good''
ones).
\end{itemize}
\textbf{What the proof does not show:}
\begin{itemize}
\tightlist
\item
That the resurrection \textbf{actually} takes place.
\item
That the resurrection takes place \textbf{temporally}.
\item
That the resurrection is \textbf{morally} justified.
\end{itemize}
\textbf{The metalogical consequence:} The resurrection follows
\textbf{necessarily} from the axioms. But the axioms themselves are
\textbf{strong} --- they presuppose that \textbf{all} consciousnesses
are integrated, that \textbf{all} existence is conserved, that death is
\textbf{always} integration.
\textbf{That is why Modal 10 exists:} It shows that the resurrection
also follows from \textbf{weaker} assumptions (U1--U3) --- namely from
the unitarity as the structure of T itself.
\subsection{5. The Arc of the Resurrection Through the
Series}\label{the-arc-of-the-resurrection-through-the-series}
\begin{verbatim}
Modal 5, Part IV: Resurrection from A16βA20 (strong)
S5+SP+U β’ β‘βc (Consciousness(c) β Resurrection(c))
Modal 10: Resurrection from U1βU3 (weak)
S5+U1+U2+U3 β’ β‘βc (Consciousness(c) β βResurrection(c))
Modal 16: Paths without Omega Point β structural integration
βΞ³βT: Ξ³βT (the "Hawking radiation of meaning")
\end{verbatim}
\textbf{The point:} The resurrection is treated \textbf{three times} in
the series --- each time with \textbf{weaker} assumptions and
\textbf{stronger} consequence. That is the \textbf{red thread} through
the series.
\begin{center}\rule{0.5\linewidth}{0.5pt}\end{center}
\section{Afterword}\label{afterword}
You have read this file. You have followed the proof of the resurrection
move by move --- with symbol explanation at every step and plain
language for every statement. Perhaps you can now \textbf{understand}
the proof, even if you could not \textbf{conduct} it yourself.
What remains is the insight: The resurrection is \textbf{not an article
of faith}, but a \textbf{theorem} from A16--A20. But the axioms are
\textbf{strong} --- and therefore in Modal 10 the \textbf{weaker} proof
from U1--U3 follows, and in Modal 16 the \textbf{structural}
integration.
\emph{This file was written in the spirit of strict modal logic, yet in
the language of a chess journalist --- for the proof requires both: the
precision of the formula and the vividness of the move.}
\end{document}