scientific article; zbMATH DE number 5038466

zbMATH Open1105.03059MaRDI QIDQ5477362FDOQ5477362

Pavel Pudlák

Publication date: 3 July 2006

Title of this publication is not available (Why is that?)

zbMATH Keywords

bounded arithmeticproof complexitytwo-player game

Mathematics Subject Classification ID

Applications of game theory (91A80) 2-person games (91A05) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Cited In (6)

• Title not available (Why is that?)
• A Characterisation of Definable NP Search Problems in Peano Arithmetic
• Parallel strategies
• Converse consistent enlargements of the unit-level-core of the multi-choice games
• Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
• Unprovability of strong complexity lower bounds in bounded arithmetic

   Recommendations

• Title not available (Why is that?) 👍 👎
• The consistency principle for games in strategic form 👍 👎
• Title not available (Why is that?) 👍 👎
• On consistent solutions for strategic games 👍 👎
• Title not available (Why is that?) 👍 👎
• Recent results and questions in combinatorial game complexities 👍 👎
• Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) 👍 👎
• Tarski's fixpoint lemma and combinatorial games 👍 👎
• A Survey of Consistency Properties in Cooperative Game Theory 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477362)