LCM: Markov Principle.
(¬¬∃x.P(x)⇒∃x.P(x))

In[402]:=

Clear[P] ;

In[403]:=

F13 = Impl[Neg[Neg[Ex["x", "P(x)"]]], Ex["x", "P(x)"]] ;

In[404]:=

Lin[F13]

Out[404]=

(¬¬∃x.P(x)∃x.P(x))

Thin and thick edges in Eloise's view-tree (a reminder). Whenever we backtrack from position i to position j<i, we retract all positions j+1, ..., i. We mark this fact by drawing the edges leading to the positions j+1, ..., i thinner. If the position j was retracted, and now we recover it, the whole play comes back to the state it was in position j. We mark this fact by drawing the edges leading to positions 1, ..., j either thin or thick, according if they were thin or thick in the view-tree for position j. A single move can change the look of the view-tree deeply, because we can recover an older state of the tree.

Dotted positions (reminder). We mark with a big dot any position to which Eloise can backtrack to using intuitionistic backtracking: all negative judgements of the tree, and the last positive judgement, in the part of the tree having thick edges.

We choose the parameters of the game.

In[405]:=

savedplay = ( "move 1"     "Box"      ) ;                  ... LCM, ConstructiveImplication, CutFree", "TreeWidth=800, FontSize=18", savedplay] ;

[Graphics:../HTMLFiles/index_1985.gif]

[Graphics:../HTMLFiles/index_1986.gif]

[Graphics:../HTMLFiles/index_1987.gif]

\n\n

[Graphics:../HTMLFiles/index_1989.gif]

[Graphics:../HTMLFiles/index_1990.gif]

[Graphics:../HTMLFiles/index_1991.gif]

[Graphics:../HTMLFiles/index_1992.gif]

[Graphics:../HTMLFiles/index_1993.gif]

Goal of: Eloise

{}

⊢

{} , (¬¬∃x.P(x)∃x.P(x))

Goal of: Abelard

{} , (¬¬∃x.P(x)∃x.P(x)),  {}

⊢

{}

____________________________________________________________________

Abelard must attack the only subformula (¬¬∃x.P(x)∃x.P(x))

Abelard moves: Box

\n\n

[Graphics:../HTMLFiles/index_2004.gif]

[Graphics:../HTMLFiles/index_2005.gif]

[Graphics:../HTMLFiles/index_2006.gif]

[Graphics:../HTMLFiles/index_2007.gif]

[Graphics:../HTMLFiles/index_2008.gif]

Goal of: Eloise

{}

⊢

{(¬¬∃x.P(x)∃x.P(x))} , (¬¬∃x.P(x)∃x.P(x))

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x))} , (¬¬∃x.P(x)∃x.P(x)),  {}

⊢

{}

____________________________________________________________________

Eloise must either attack the left, or defend the right subformula of (¬¬∃x.P(x)∃x.P(x))

Eloise moves: Left

\n\n

[Graphics:../HTMLFiles/index_2019.gif]

[Graphics:../HTMLFiles/index_2020.gif]

[Graphics:../HTMLFiles/index_2021.gif]

[Graphics:../HTMLFiles/index_2022.gif]

[Graphics:../HTMLFiles/index_2023.gif]

Goal of: Eloise

{} , ¬¬∃x.P(x),  {}

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))}

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))}

⊢

{} , ¬¬∃x.P(x)

____________________________________________________________________

Eloise must defend the only subformula of ¬¬∃x.P(x)

Eloise moves: Negation

\n\n

[Graphics:../HTMLFiles/index_2034.gif]

[Graphics:../HTMLFiles/index_2035.gif]

[Graphics:../HTMLFiles/index_2036.gif]

[Graphics:../HTMLFiles/index_2037.gif]

[Graphics:../HTMLFiles/index_2038.gif]

Goal of: Eloise

{¬¬∃x.P(x)}

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))} , ¬∃x.P(x)

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))} , ¬∃x.P(x),  {}

⊢

{¬¬∃x.P(x)}

____________________________________________________________________

Abelard must defend the only subformula of ¬∃x.P(x)

Abelard moves: Negation

\n\n

[Graphics:../HTMLFiles/index_2049.gif]

[Graphics:../HTMLFiles/index_2050.gif]

[Graphics:../HTMLFiles/index_2051.gif]

[Graphics:../HTMLFiles/index_2052.gif]

[Graphics:../HTMLFiles/index_2053.gif]

Goal of: Eloise

{¬¬∃x.P(x)} , ∃x.P(x),  {}

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

⊢

{¬¬∃x.P(x)} , ∃x.P(x)

____________________________________________________________________

Abelard must defend of some instance x of ∃x.P(x)

Abelard moves: x=a

\n\n

[Graphics:../HTMLFiles/index_2064.gif]

[Graphics:../HTMLFiles/index_2065.gif]

[Graphics:../HTMLFiles/index_2066.gif]

[Graphics:../HTMLFiles/index_2067.gif]

[Graphics:../HTMLFiles/index_2068.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x)} , P(a),  {}

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

⊢

{¬¬∃x.P(x), ∃x.P(x)} , P(a)

____________________________________________________________________

P(a) is true.

Abelard moves: Atom

\n\n

[Graphics:../HTMLFiles/index_2079.gif]

[Graphics:../HTMLFiles/index_2080.gif]

[Graphics:../HTMLFiles/index_2081.gif]

[Graphics:../HTMLFiles/index_2082.gif]

[Graphics:../HTMLFiles/index_2083.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x), P(a)} , ,  {}

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ¬∃x.P(x)}

⊢

{¬¬∃x.P(x), ∃x.P(x), P(a)} , 

____________________________________________________________________

Eloise has no subformulas to choose.

Eloise backtracks to the node number 2 of the play.

This backtracking drops out the current goal and possibly more nodes (proper LCM move).

\n\n

[Graphics:../HTMLFiles/index_2095.gif]

[Graphics:../HTMLFiles/index_2096.gif]

[Graphics:../HTMLFiles/index_2097.gif]

[Graphics:../HTMLFiles/index_2098.gif]

[Graphics:../HTMLFiles/index_2099.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x), P(a), }

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))} , (¬¬∃x.P(x)∃x.P(x))

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x))} , (¬¬∃x.P(x)∃x.P(x)),  {}

⊢

{}

____________________________________________________________________

Eloise must either attack the left, or defend the right subformula of (¬¬∃x.P(x)∃x.P(x))

Eloise moves: Right

\n\n

[Graphics:../HTMLFiles/index_2110.gif]

[Graphics:../HTMLFiles/index_2111.gif]

[Graphics:../HTMLFiles/index_2112.gif]

[Graphics:../HTMLFiles/index_2113.gif]

[Graphics:../HTMLFiles/index_2114.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x), P(a), }

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))} , ∃x.P(x)

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x))} , ∃x.P(x),  {}

⊢

{}

____________________________________________________________________

Eloise must defend of some instance x of ∃x.P(x)

Eloise moves: x=a

\n\n

[Graphics:../HTMLFiles/index_2125.gif]

[Graphics:../HTMLFiles/index_2126.gif]

[Graphics:../HTMLFiles/index_2127.gif]

[Graphics:../HTMLFiles/index_2128.gif]

[Graphics:../HTMLFiles/index_2129.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x), P(a), }

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ∃x.P(x)} , P(a)

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ∃x.P(x)} , P(a),  {}

⊢

{}

____________________________________________________________________

P(a) is true.

Eloise moves: Atom

\n\n

[Graphics:../HTMLFiles/index_2140.gif]

[Graphics:../HTMLFiles/index_2141.gif]

[Graphics:../HTMLFiles/index_2142.gif]

[Graphics:../HTMLFiles/index_2143.gif]

[Graphics:../HTMLFiles/index_2144.gif]

Goal of: Eloise

{¬¬∃x.P(x), ∃x.P(x), P(a), }

⊢

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ∃x.P(x), P(a)} , 

Goal of: Abelard

{(¬¬∃x.P(x)∃x.P(x)), (¬¬∃x.P(x)∃x.P(x)), ∃x.P(x), P(a)} , ,  {}

⊢

{}

____________________________________________________________________

Abelard has no subformulas to choose.

Abelard gives up.

[Graphics:../HTMLFiles/index_2154.gif]

This is the list of all moves of the play:

( move 1     Box      )            move 2     L            move 3     Negation ...         move 7     R            move 8     a            move 9     Atom            move 10    drop


Created by Mathematica  (November 11, 2006)