2 citations · 4 across the 7 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.LO2014
On the complexity of finding falsifying assignments for Herbrand disjunctions
Pavel Pudlak
Suppose that is a consistent sentence. Then there is no Herbrand proof of , which means that any Herbrand disjunction made from the prenex form of is falsifiab…
cs.CC2014
Partition Expanders
Dmytro Gavinsky, Pavel Pudlák
We introduce a new concept, which we call partition expanders. The basic idea is to study quantitative properties of graphs in a slightly different way than it is in the standard d…