Scribd
Upload
89 views5 pages

HD07.Proof of Completeness For PL

This document discusses soundness, completeness, and compactness in classical propositional logic. It defines soundness as Γ ` ψ implying Γ |= ψ, and completeness as Γ |= ψ implying Γ ` ψ. It provides an outline of the proof of soundness using course-of-values induction, and says completeness can be shown by establishing preliminary results when Γ is finite. For infinite Γ, compactness is needed: a set Γ is satisfiable if every finite subset is, and compactness implies Γ |= ψ if a finite subset implies it. Proofs of compactness and its corollary are referenced but not shown.

Uploaded by

Abhinav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views5 pages

HD07.Proof of Completeness For PL

This document discusses soundness, completeness, and compactness in classical propositional logic. It defines soundness as Γ ` ψ implying Γ |= ψ, and completeness as Γ |= ψ implying Γ ` ψ. It provides an outline of the proof of soundness using course-of-values induction, and says completeness can be shown by establishing preliminary results when Γ is finite. For infinite Γ, compactness is needed: a set Γ is satisfiable if every finite subset is, and compactness implies Γ |= ψ if a finite subset implies it. Proofs of compactness and its corollary are referenced but not shown.

Uploaded by

Abhinav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CS 511, Fall 2019, Handout 07

Semantics of Classical Propositional Logic


(Continued)
Soundness, Completeness, Compactness

Assaf Kfoury

September 10, 2019

Assaf Kfoury, CS 511, Fall 2019, Handout 07 page 1 of 5


Soundness
I Let Γ a (possibly infinite) set of propositional wff’s.
If, for every model/interpretation/valuation
(i.e., assignment of truth values to prop atoms), it holds that:
I whenever all the wff’s in Γ evaluate to T ,
I it is also the case that ψ evaluates to T ,
then we write:

Γ |= ψ in words, “Γ semantically entails ψ ”

I Theorem (Soundness): If Γ ` ψ then Γ |= ψ .


(Slightly stronger than the statement of Soundness in [LCS, Theorem 1.35, p 46]:
If ϕ1 , ϕ2 , . . . , ϕn ` ψ then ϕ1 , ϕ2 , . . . , ϕn |= ψ .)

I Proof idea: “Course-of-values” induction on n > 1


(in a later Handout 08).
Assaf Kfoury, CS 511, Fall 2019, Handout 07 page 2 of 5
Completeness
I Theorem (Completeness): If Γ |= ψ then Γ ` ψ .
(Stronger than the statement of Completeness in [LCS, Corollary 1.39, p 53]:
If ϕ1 , ϕ2 , . . . , ϕn |= ψ then ϕ1 , ϕ2 , . . . , ϕn ` ψ .)

I Proof idea in [LCS] (which works if Γ is a finite set {ϕ1 , . . . , ϕn }):

Establish 3 preliminary results. From ϕ1 , . . . , ϕn |= ψ , show that:


1. |= ϕ1 → (ϕ2 → (ϕ3 → (· · · (ϕn → ψ) · · · ))) holds.
2. ` ϕ1 → (ϕ2 → (ϕ3 → (· · · (ϕn → ψ) · · · ))) is a valid sequent.
3. ϕ1 , ϕ2 , . . . , ϕn ` ψ is a valid sequent.

I If Γ is infinite, we need another preliminary result: Compactness .

Assaf Kfoury, CS 511, Fall 2019, Handout 07 page 3 of 5


Compactness
I Γ is said to be satisfiable if there is a model/interpretation/valuation
which satisfies/makes true every ϕ in Γ.

I Theorem (Compactness) (not in [LCS]):


Γ is satisfiable iff every finite subset of Γ is satisfiable.

I Corollary (not in [LCS]):


If Γ |= ψ then there is a finite subset Γ0 ⊆ Γ such that Γ0 |= ψ .

I For proofs of Compactness above and its corollary, click here .

Assaf Kfoury, CS 511, Fall 2019, Handout 07 page 4 of 5


( THIS PAGE INTENTIONALLY LEFT BLANK )

Assaf Kfoury, CS 511, Fall 2019, Handout 07 page 5 of 5

You might also like