Skip to main content Accessibility help
×
×
Home

Parallel strategies

  • Pavel Pudlák (a1)
Abstract

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.

Copyright
References
Hide All
[1] Buss, S., Bounded arithmetic, Bibliopolis, 1986.
[2] Gale, D. and Steward, F., Infinite games with perfect information, Annals of Mathematics Studies, vol. 28 (1953), pp. 245266.
[3] Hájek, P. and Pudlák, P., Metamathematics of First-Order Arithmetic, Springer, 1993.
[4] Krajíček, J., Bounded Arithmetic, Propositional Logic and Complexity Theory, Cambridge University Press, 1995.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed