Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Proofs (cont’)

  • If there exists a proof of a sentence φ from a set Δ of premises and the standard axiom schemata using Modus Ponens, then φ is said to be provable from Δ, written as

    Δ φ

  • There is a close connection between provability and logical entailment (⊧):

    A set of sentences Δ logically entails a sentence φ if and only if φ is provable from Δ

  • Soundness Theorem:

    If φ is provable from Δ, then Δ logically entails φ.

  • Completeness Theorem:

    If Δ logically entails φ, then φ is provable from Δ.

Speaker notes:

Content Tools


There are currently no sources for this slide.