Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-27T08:14:03.643Z Has data issue: false hasContentIssue false

14 - Hard tautologies and optimal proof systems

Published online by Cambridge University Press:  02 December 2009

Jan Krajicek
Affiliation:
Academy of Sciences of the Czech Republic, Prague
Get access

Summary

We shall study in this chapter the topic of hard tautologies: tautologies that are candidates for not having short proofs in a particular proof system. The closely related question is whether there is an optimal propositional proof system, that is, a proof system P such that no other system has more than a polynomial speed-up over P. We shall obtain a statement analogous to the NP-completeness results characterizing any propositional proof system as an extension of EF by a set of axioms of particular form. Recall the notions of a proof system and p-simulation from Section 4.1, the definitions of translations of arithmetic formulas into propositional ones in Section 9.2, and the relation between reflection principles (consistency statements) and p-simulations established in Section 9.3. We shall also use the notation previously used in Chapter 9.

Finitistic consistency statements and optimal proof systems

We shall denote by Taut (x) the formula Taut0 (x) from Section 9.3 defining the set of the (quantifierfree) tautologies, denoted TAUT itself.

Recall from Section 9.2 the definition of the translation

producing from a formula a sequence of propositional formulas (Definition 9.2.1, Lemma 9.2.2).

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book 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.

Find out more about the Kindle Personal Document Service.

  • Hard tautologies and optimal proof systems
  • Jan Krajicek, Academy of Sciences of the Czech Republic, Prague
  • Book: Bounded Arithmetic, Propositional Logic and Complexity Theory
  • Online publication: 02 December 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511529948.015
Available formats
×

Save book to Dropbox

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 Dropbox.

  • Hard tautologies and optimal proof systems
  • Jan Krajicek, Academy of Sciences of the Czech Republic, Prague
  • Book: Bounded Arithmetic, Propositional Logic and Complexity Theory
  • Online publication: 02 December 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511529948.015
Available formats
×

Save book to Google Drive

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 Google Drive.

  • Hard tautologies and optimal proof systems
  • Jan Krajicek, Academy of Sciences of the Czech Republic, Prague
  • Book: Bounded Arithmetic, Propositional Logic and Complexity Theory
  • Online publication: 02 December 2009
  • Chapter DOI: https://doi.org/10.1017/CBO9780511529948.015
Available formats
×