Back to the index. Or to the chambers
This article has 9 links. View as Cloud or List.
| 1 | Reflexive Non Degenerate Sesquilinear |
| 1 | Obvious |
| 1 | Variable |
| 1 | Superset |
| 1 | Terms And Formulas |
| 1 | Induction |
| 1 | Equation |
| 2 | Transitive |
| 2 | Free And Bound Variables |
Loading ...
Planetmath Browser (2008—2009)
BSD licence | A django site
All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.
→ The original article on PlanetMath.org
Other Formats: LaTeX
Subformula
Let
be a first order language
and suppose
is a formula
of
. A subformula of
is defined as any of the following:
is a subformula of
;
- if
is a subformula of
for some
-formula
, then so is
;
- if
is a subformula of
for some
-formulas
, then so are
and
;
- if
is a subformula of
for some
-formula
, then so is
for any
free for
in
.
For example, if
, then
and
are subformulas of
. This is so because
, so that
is a subformula of
by applications
of 1 followed by 2 above. By 3 above,
and
are subformulas of
. Therefore, by 2 again,
and
are subformulas of
.
For another example, if
, then
is a subformula of
as long as
is a term that does not contain
the variable
. Therefore, if
, then
is not a subformula of
. In fact, if
, the equation
is never true.
Finally, it is easy to see
(by induction) that if
is a subformula of
and
is a subformula of
, then
is a subformula of
. “Being a subformula of” is a reflexive
transitive relation
on
-formulas.
Remark. There is also the notion of a literal subformula of a formula
. A formula
is a literal subformula of
if it is a subformula of
obtained in any one of the first three ways above, or if
is a literal subformula of
.
Note that any literal subformula of
is a subformula of
, for if
, then
occurs free in
and
.
In the second example above,
and
are both literal subformulas of
.