1/8
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Valid Propositional
If for all variable assignments the formula is True
Satisfiable Propositional
If there is at least one variable assignment that makes the formula is True
Unsatisfiable Propositional
If there are no variable assignment that makes the formula is True
Valid Predicate
If it evaluates to true in every possible structure under every possible variable assignment
Satisfiable Predicate
If there exists at least one structure and at least one variable assignment such that the formula evaluates to True
Unsatisfiable Predicate
If there exists no structures and no variable assignments such that the formula evaluates to True
Soundness
A proof system is sound if everything that can be proven using its rules is actually semantically True
Completeness
A proof system is complete if everything that is semantically true can actually be proven using its rules.
Logic is Sound and Complete
It means the proof system is correct and exhaustive; a formula can be proven if and only if it is universally true.