Larisa Maksimova on Implication, Interpolation, and Definability by Sergei Odintsov

Author:Sergei Odintsov
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

Proof

We first prove that every -labeled tree which is accepted by , is accepted by (i.e. accepts the tree where ).

If is accepted by , let be a winning strategy for Player I in the game of over T. Using and a winning strategy for Player II in the game we shall define a strategy for Player I in the game of over , and prove it is a winning one.

Claim

We claim that a strategy can be defined in such a way to preserve the following invariant: any -play of over ,

leaves a trace

which is a -play of over , and a trace

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.