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

4 - Basic propositional logic

Published online by Cambridge University Press:  02 December 2009

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

Summary

This chapter will present basic propositional calculus. By that I mean properties of propositional calculus established by direct combinatorial arguments as distinguished from high level arguments involving concepts (or motivations) from other parts of logic (bounded arithmetic) and complexity theory.

Examples of the former are various simulation results or the lower bound for resolution from Haken (1985). Examples of the latter are the simulation of the Frege system with substitution by the extended Frege system (Lemma 4.5.5 and Corollary 9.3.19), or the construction of the provably hardest tautologies from the fmitistic consistency statements (Section 14.2).

We shall define basic propositional proof systems: resolution R, extended resolution ER, Frege system F, extended Frege system EF, Frege system with the substitution rule SF, quantified propositional calculus G, and Gentzen's sequent calculus LK. We begin with the general concept of a propositional proof system.

Propositional proof systems

A property of the usual textbook calculus is that it can be checked in deterministic polynomial time whether a string of symbols is a proof in the system or not. This is generalized into the following basic definition of Cook and Reckhow (1979).

Definition 4.1.1. Let TA UT be the set of propositional tautologies in the language with propositional connectives: constants 0 (FALSE) and 1 (TRUE), ¬ (negation), ∨ (disjunction), and & (conjunction), and atoms p1, p2,…

A propositional proof system is a polynomial time function P whose range is the set TAUT.

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.

  • Basic propositional logic
  • 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.005
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.

  • Basic propositional logic
  • 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.005
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.

  • Basic propositional logic
  • 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.005
Available formats
×