1/9
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Substitution
Replacing all free occurrences of a variable in a WFF with a term
Composition of Substitutions
Applying one substitution followed by another in a specific order
Prenex Normal Form
A form of WFF with quantifiers preceding a quantifier-free sub-formula
Matrix of a WFF
The quantifier-free sub-formula in the prenex normal form of a WFF
Skolemization
Converting WFFs to remove existential quantifiers
Most General Unifier (MGU)
A unifier that can be composed with any other unifier to unify a set of terms
Robinson’s Theorem
Every set of unifiable clauses has a Most General Unifier
Equisatisfiable
Two WFFs are equisatisfiable if one is satisfiable if and only if the other is satisfiable
Equivalence of WFFs
Two logically equivalent formulas are equisatisfiable
Theorem on Equivalence
A WFF in predicate logic is equisatisfiable to its Skolem form