Consistency and games - in search of new combinatorial principles

0039356 - MÚ 2007 RIV US eng C - Conference Paper (international conference)
Pudlák, Pavel
Consistency and games - in search of new combinatorial principles.
[Bezespornost a hry - hledání nových kombinatorických principů.]
Logic Colloquium ´03. Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic. Wellesley: Association for Symbolic Logic, 2006 - (Stoltenberg-Hansen, V.; Väänänen, J.), s. 244-281. Lecture Notes in Logic, 24. ISBN 1-56881-293-0.
[Logic Colloquium 2003. Helsinki (FI), 14.08.2003-20.08.2003]
R&D Projects: GA AV ČR(CZ) IAA1019401; GA ČR(CZ) GA201/01/1195; GA ČR GD401/03/H047
Institutional research plan: CEZ:AV0Z1019905
Keywords : independent sentences * peano arithmetic * bounded arithmetic
Subject RIV: BA - General Mathematics

We present .sigma.1b combinatorial sentences that characterize all .sigma. 1b sentences provable in S2.

Předkládáme .sigma.1b kombinatorické věty, které charakterizují všechny .sigma.1b dokazatelné věty v S2.
Permanent Link: http://hdl.handle.net/11104/0133466