An Ehrenfeucht-Fraïssé game for inline image

Authors

  • Jouko Väänänen,

    1. Department of Mathematics and Statistics, University of Helsinki, Finland
    2. Institute for Logic, Language and Computation, Universiteit van Amsterdam, Amsterdam, The Netherlands
    Search for more papers by this author
  • Tong Wang

    Corresponding author
    1. Institute for Logic, Language and Computation, Universiteit van Amsterdam, Amsterdam, The Netherlands
    • Department of Mathematics and Statistics, University of Helsinki, Finland
    Search for more papers by this author

Corresponding author: e-mail: tongwang01@gmail.com

Abstract

In this paper we develop an Ehrenfeucht-Fraïssé game for inline image. Unlike the standard Ehrenfeucht-Fraïssé games which are modeled solely after the behavior of quantifiers, this new game also takes into account the behavior of connectives in logic. We prove the adequacy theorem for this game. We also apply the new game to prove complexity results about infinite binary strings.

Ancillary