Search filters

List of works by Pavel Pudlák

An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle

scientific article

An improved exponential-time algorithm for k-SAT

scientific article published in May 2005

Bounded arithmetic and the polynomial hierarchy

scientific article

Congruence lattices of finite algebras and intervals in subgroup lattices of finite groups

scholarly article by Péter Pál Pálfy & Pavel Pudlák published December 1980 in Algebra Universalis

Cuts, consistency statements and interpretations

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction

Lower bounds on Hilbert’s Nullstellensatz and propositional proofs

Proofs as Games

Propositional proof systems, the consistency of first order theories and the complexity of computations

scientific article

Quantified propositional calculi and fragments of bounded arithmetic

Some consequences of cryptographical conjectures for S12 and EF

scientific article

The Complexity of Proving That a Graph Is Ramsey

2013 scholarly article by Massimo Lauria et al. published in Combinatorica

The Lengths of Proofs

scientific article (publication date: 1998)

The complexity of proving that a graph is Ramsey

February 2016 scholarly article by Massimo Lauria et al. published in Combinatorica

The number of proof lines and the size of proofs in first order logic

Paulina is supported by:

About Paulina

Help