Bounded variable logics: two, three, and more

Consider the bounded variable logics (with k variable symbols), and (with k variables in the presence of counting quantifiers ). These fragments of infinitary logic are well known to provide an adequate logical framework for some important issues in finite model theory. This paper deals with a translation that associates equivalence of structures in the k-variable fragments with bisimulation equivalence between derived structures. Apart from a uniform and intuitively appealing treatment of these equivalences, this approach relates some interesting issues for the case of an arbitrary number of variables to the case of just three variables. Invertibility of the invariants for , in particular, would imply a positive answer to the tempting conjecture that fixed-point logic with counting captures Ptime . Received July 13, 1996