27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Prof. Dr. Jürgen Dix · Department of Informatics, TUC <strong>Multiagent</strong> <strong>Systems</strong>, WS 06/07 450/731<br />

6. Propositional Logic 4. Calculi for SL<br />

Definition 6.12 (Proof)<br />

A proof of a formula ϕ from a theory T ⊆ F ml L<br />

is a sequence ϕ 1 , . . . , ϕ n of formulae such that<br />

ϕ n = ϕ and for all i with 1 ≤ i ≤ n one of the<br />

following conditions holds:<br />

ϕ i is substitution instance of an axiom,<br />

ϕ i ∈ T ,<br />

there is ϕ l , ϕ k = (ϕ l → ϕ i ) with l, k < i. Then<br />

ϕ i is the result of the application of modus<br />

ponens on the predecessor-formulae of ϕ i .<br />

We write: T ⊢ ϕ (ϕ can be derived from T ).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!