Merge pull request #1 from KirisameVanilla/main

计算机逻辑基础
2025-01-08 14:48:27 +08:00 · 2025-01-08 14:48:27 +08:00 · d0ce581774
parent b829f81033 2d45578933
commit d0ce581774
8 changed files with 9 additions and 0 deletions
--- a/计算机逻辑基础/24FallFinalExamExcerpt.md
+++ b/计算机逻辑基础/24FallFinalExamExcerpt.md
@ -0,0 +1,9 @@
 What is the definition of validity for a propositional logic formula?
 PLz explain how to determine whether a given propositional logic formula with CNF is valid.
 Please illustrate the different treatment for free and bound variables in the semantical evaluation of a predicate logic formula.
 Please state the key idea of program verification using model checking techniques.
 Prove the following sequent doesn't hold using semantical evaluation:
 ∀x∃y P(x,y) |- ∃y∀x P(x,y)
--- a/计算机逻辑基础/lecture01.pdf
+++ b/计算机逻辑基础/lecture01.pdf
--- a/计算机逻辑基础/lecture02.pdf
+++ b/计算机逻辑基础/lecture02.pdf
--- a/计算机逻辑基础/lecture03.pdf
+++ b/计算机逻辑基础/lecture03.pdf
--- a/计算机逻辑基础/lecture04.pdf
+++ b/计算机逻辑基础/lecture04.pdf
--- a/计算机逻辑基础/lecture05.pdf
+++ b/计算机逻辑基础/lecture05.pdf
--- a/计算机逻辑基础/lecture06.pdf
+++ b/计算机逻辑基础/lecture06.pdf
--- a/计算机逻辑基础/lecture07.pdf
+++ b/计算机逻辑基础/lecture07.pdf