well-founded induction on formulas
Let be a first-order language. The formulas of are built by a finite application of the rules of construction. This says that the relation defined on formulas by if and only if is a subformula of is a well-founded relation. Therefore, we can formulate a principle of induction for formulas as follows : suppose is a property defined on formulas, then is true for every formula of if and only if
is true for the atomic formulas;
for every formula , if is true for every subformula of , then is true for .
|Title||well-founded induction on formulas|
|Date of creation||2013-03-22 12:42:49|
|Last modified on||2013-03-22 12:42:49|
|Last modified by||jihemme (316)|