Logicandapplications2023/class_09_24082023/summary.txt

12 lines
348 B
Plaintext
Raw Normal View History

2023-08-29 14:58:24 +05:30
Finite satisfiability
Statement of Compactness theorem
Proof :
Godel Numbering
Construction of \Delta from \Sigma
Proving that \Delta is satisfiable.
Lemma : Given \Sigma is FS. Then for any formula \alpha
\Sigma \cup \{ \alpha \} is satisfiable OR
\Sigma \cup \{ \neg \alpha \} is satisfiable.
Proof of this lemma is remaining.