Translator Disclaimer
December 2003 Parallel strategies
Pavel Pudlák
J. Symbolic Logic 68(4): 1242-1250 (December 2003). DOI: 10.2178/jsl/1067620183

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.

Citation

Download Citation

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

Information

Published: December 2003
First available in Project Euclid: 31 October 2003

zbMATH: 1055.03034
MathSciNet: MR2017351
Digital Object Identifier: 10.2178/jsl/1067620183

Rights: Copyright © 2003 Association for Symbolic Logic

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.68 • No. 4 • December 2003
Back to Top