We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The chapter defines the notion of a generator and its hardness, and formulates the hardness conjecture. It also defines a stronger notion of pseudosurjectivity of a generator and states the key conjecture about it. It examines some consequences of the two conjectures for the dWPHP problem. It also relates the hardness conjecture to feasible interpolation, gives a model-theoretic view of the issues and discusses a relation to pseudorandomness.
The chapter concentrates on the pivotal case of extended resolution. It recalls some characterizations of its lengths-of-proofs function and formulates a framework for lower bounds proofs using expansions of pseudofinite structures. It gives an example of a specific candidate construction.