27.01.2014 Views

Multiagent Systems

Multiagent Systems

Multiagent Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

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

6. Propositional Logic 2. Sentential Logic<br />

Definition 6.8 (Completeness of a Theory T )<br />

T is called complete if for each formula ϕ ∈ F ml: T |= ϕ or<br />

T |= ¬ϕ holds.<br />

Attention:<br />

Do not mix up this last condition with the property of a<br />

valuation (model) v: each model is complete in the<br />

above sense.

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

Saved successfully!

Ooh no, something went wrong!