Marcs Notes

Home

❯

university

❯

Logic

❯

Completeness

Completeness

10. Juni 20251 min read

Completeness

Φ⊨ψ⇒Φ⊢ψ

A Calculus is called complete when given a formula A entailing B can be used to derive B.

So whenever A⊨B we also have A⊢C​B.

In the sense of an Evaluation Criteria for Knowledge Representation:

  • Can I do all the inferences that I want to do
  • Can I do reasoning with incomplete knowledge

Graphansicht

Backlinks

  • POP Algorithm
  • Evaluation Criteria for Knowledge Representation
  • Logic
  • ALC Tableau Calculus
  • Unification Algorithm
  • Free Variable Tableau Calculus
  • Propositional Logic
  • MOC - Grundlagen der Logik in der Informatik

Erstellt mit Quartz v4.5.0 © 2025

  • GitHub