Journal of Symbolic Logic

Parallel strategies

Pavel Pudlák

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We consider combinatorial principles based on playing several two person games simultaneously. We call strategies for playing two or more games simultaneously parallel. The principles are easy consequences of the determinacy of games, in particular they are true for all finite games. We shall show that the principles fail for infinite games. The statements of these principles are of lower logical complexity than the sentence expressing the determinacy of games, therefore, they can be studied in weak axiomatic systems for arithmetic (Bounded Arithmetic). We pose several open problems about the provability of these statements in Bounded Arithmetic and related computational problems.

Article information

J. Symbolic Logic, Volume 68, Issue 4 (2003), 1242-1250.

First available in Project Euclid: 31 October 2003

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Pudlák, Pavel. Parallel strategies. J. Symbolic Logic 68 (2003), no. 4, 1242--1250. doi:10.2178/jsl/1067620183.

Export citation


  • S. Buss Bounded arithmetic, Bibliopolis,1986.
  • D. Gale and F. Steward Infinite games with perfect information, Annals of Mathematics Studies, vol. 28 (1953), pp. 245--266.
  • P. Hájek and P. Pudlák Metamathematics of First-Order Arithmetic, Springer,1993.
  • J. Krajíček Bounded Arithmetic, Propositional Logic and Complexity Theory, Cambridge University Press,1995.