Definition: Linear Independence

edit

In the language of first-order logic, the set of functions   is linearly independent, over the interval   in  , iff:

 ,

where  . Expressed in disjunctive normal form the above definition reads:

 ,

in which   represents the words occurring before the iff.


Theorem: The Wronskian and Linear Independence

edit
 ,

i.e.,

 .

Proof

edit

(I)
A A pq

(¬R)
 ¬A, A

(CR)
  A ¬A

A typical rule is:

 

This indicates that if we can deduce   from  , we can also deduce it from   together with  

However, one can make syntactic reasoning more convenient by introducing lemmas, i.e. predefined schemes for achieving certain standard derivations. As an example one could show that the following is a legal transformation:

Γ  A B, Δ

Γ  B A, Δ

Good