Math and science::Theory of Computation::Modal theory
-formula implication
We wish to introduce an idea of implication between sets of
-formula.
First, we must generalize the idea of truth/satisfaction that was introduced
for -formula.
Model
Let be a first-order language. Let be
an -structure for and let be an
-formula of .
If for every [what?], then we say that is a model
of (or models ). We write
.
Extendion to sets of -formula: if
is a model for every -formula in a set of
-formulas, , then we say
is a model of , and we write .
If we compare two sets of -formula we arrive at a type of implication.
Logical implication, under a structure
Let and be two sets of -formulas
from the same language .
Let be an -structure for .
If implies ,
we say that
logically implies under .
In other words, if whenever all the [what?] are satisfied by so too are the [what?].
Finally, we remove the dependency on a specific structure.
Logical implication
Let and be two sets of -formulas
from the same language .
If
[what?]
for any
[what?] of ,
then we say that
logically implies .
We write this as .