Janos and I started working on extending the fixed point theorem to the infinite case at MIRI's June decision theory workshop with Patrick and Benja. This post attempts to exhibit the finite version of the theorem and speculates about a plausible extension.

Algorithm for the finite case

Suppose we're given variables $p_{1}, \dots, p_{n}$ , and statements $p_{i} \leftrightarrow ϕ_{i} (p_{1}, \dots, p_{n})$ where each $ϕ_{i}$ is fully modalized (no variables occur outside modal subformulas). We will describe an algorithm for constructing sentences $ψ_{i}$ with no free variables, such that the original statements are equivalent to $p_{1} \leftrightarrow ψ_{1}, \dots, p_{n} \leftrightarrow ψ_{n}$ .

For simplification purposes, we will assume that each $ϕ_{i}$ is only singly modalized (none of the modal subformulas contain further modal subformulas). If not, we can introduce new variables for each subformula of the form $□ ϕ_{i, j}$ that occurs in a fully modalized context.

Now consider a sequence of theories $W_{0}, W_{1}, \dots$ , where $W_{i} \equiv P A \cup {□^{i + 1} ⊥, \neg □^{i} ⊥}$ .

In $W_{0}$ , it's easy to determine the truth value of each $p_{i}$ : every modal subformula can be replaced with $⊤$ , leaving a propositional formula with no variables.

Now suppose we've done this for $W_{0}, \dots, W_{n - 1}$ . Then, a statement $□ ϕ$ will be true in $W_{n}$ iff

$P A ⊢ (□^{n + 1} ⊥ \land \neg □^{n} ⊥) \to □ ϕ \Leftrightarrow □^{n} ⊥ \lor □ (□^{n} ⊥ \to ϕ) \Leftrightarrow □^{n} ⊥ \lor □ n - 1 ⋀ i = 0 ((□^{i + 1} ⊥ \land \neg □^{i} ⊥) \to ϕ)$

Therefore $□ ϕ$ will be true in $W_{n}$ iff $ϕ$ is true in $W_{0}, \dots, W_{n - 1}$ ; this will let us evaluate the truth value of $p_{i}$ in all of the theories $W_{1}, \dots, W_{n}$ .

It's clearly the case that every modal subformula will have truth value stabilizing, therefore every $p_{i}$ will also. So there is an $N$ such that $W_{n}$ has the same truth values as $W_{N}$ for $n > N$ . Now if $W_{N} ⊢ p_{i}$ , construct $ψ_{i} \equiv \neg ⋁_{i : W_{i} ⊢ \neg p_{i}} (□^{i + 1} ⊥ \land \neg □^{i} ⊥)$ ; otherwise construct $ψ_{i} \equiv ⋁_{i : W_{i} ⊢ p_{i}} (□^{i + 1} ⊥ \land \neg □^{i} ⊥)$ . These are variable-free formulas.

Infinite case example: Procrastination Bot

def ProcrastinationBot $_{N}$ (X):

if $P A + N ⊢ □ X (P B_{N + 1}) = C$ :

return C

else: return D

Constructing the fixed point

Let $p_{i j}$ denote whether $P B_{i}$ cooperates with $P B_{j}$ . Then $p_{i j} \leftrightarrow □_{i} p_{j, i + 1} = □_{i} □_{j} p_{i + 1, j + 1}$ where $□_{i}$ stands for $\neg □^{i} ⊥ \to □$ (e.g. $□_{0} = □$ ).

Then the following statements hold $p_{00} \leftrightarrow □ □ p_{11}$ $p_{11} \leftrightarrow □_{1} □_{1} p_{22} \equiv \neg □ ⊥ \to □ (\neg □ ⊥ \to □ p_{22})$ $\dots$

In $W_{0}$ , any statement with a box in front of it is true, so any statement where a boxed statement is implied is also true. Thus, all the relevant statements are true in $W_{0}$ :

Theory	$p_{00}$	$□ □ p_{11}$	$p_{11}$	$\neg □ ⊥ \to □ (\neg □ ⊥ \to □ p_{22})$	$\neg □ ⊥ \to □ p_{22}$	$p_{22}$	$\dots$
$W_{0}$		$⊤$		$⊤$	$⊤$

In $W_{i + 1}$ , all the implied statements are boxed statements that were true in $W_{i}$ , e.g. $□ p_{22}$ or $\neg □ ⊥ \to □ p_{22}$ . Thus, all the relevant statements are true in $W_{i + 1}$ :

Theory	$p_{00}$	$□ □ p_{11}$	$p_{11}$	$\neg □ ⊥ \to □ (\neg □ ⊥ \to □ p_{22})$	$\neg □ ⊥ \to □ p_{22}$	$p_{22}$
$W_{0}$	$⊤$	$⊤$	$⊤$	$⊤$	$⊤$	$⊤$
$⋮$	$⋮$	$⋮$	$⋮$	$⋮$	$⋮$	$⋮$
$W_{i + 1}$		$⊤$		$⊤$	$⊤$

Thus, any Procrastination Bot cooperates with any other Procrastination Bot.

Existence and uniqueness of the fixed point via quining

Given a formula $ψ (m, n)$ , there exists formula $ϕ (n)$ such that $⊢ ϕ (n) \leftrightarrow ψ (┌ ϕ ┐, n)$ . The quine construction (thanks Benja!) is $ϕ (n) \equiv ψ (let k = ┌ ψ (let k = x in {subst}_{┌ x ┐} (quote (k), k)) ┐ in {subst}_{┌ x ┐} (quote (k), k), n)$

Let $ψ (┌ ϕ ┐, n) = □ ┌ ϕ (¯ ¯¯¯¯¯¯¯¯¯¯¯ ¯ n + 1) ┐$ . Then we have $P A ⊢ \forall n : (ϕ (n) \leftrightarrow □ ┌ ϕ (¯ ¯¯¯¯¯¯¯¯¯¯¯ ¯ n + 1) ┐) .$

Now consider that $□ ┌ \forall n : ϕ (n) ┐ \to □ ┌ ϕ (¯ ¯¯¯¯¯¯¯¯¯¯¯ ¯ n + 1) ┐$ . Using the above, we have $P A ⊢ □ ┌ \forall n : ϕ (n) ┐ \to \forall n : ϕ (n) .$

By Lob's theorem, $P A ⊢ \forall n : ϕ (n)$ , so a fixed point exists.

Assume there are two fixed points $ϕ$ and $ϕ^{'}$ . Then we have $P A ⊢ \forall n : [ϕ (n) \leftrightarrow ψ (┌ ϕ ┐, n)] \land [ϕ^{'} (n) \leftrightarrow ψ (┌ ϕ^{'} ┐, n)],$ $P A ⊢ \forall ┌ ϕ ┐, ┌ ϕ^{'} ┐ : □ ┌ \forall n : ϕ (n) \leftrightarrow ϕ^{'} (n) ┐ \to [ψ (┌ ϕ ┐, n) \leftrightarrow ψ (┌ ϕ^{'} ┐, n)]$ Thus, $P A ⊢ \forall n : ϕ (n) \leftrightarrow ϕ^{'} (n)$ , so the fixed points are the same.

LESSWRONG
LW

LESSWRONG
LW

5

Fixed point theorem in the finite and infinite case

5

Ω 2

5

Ω 2

Algorithm for the finite case

Infinite case example: Procrastination Bot