go-v.orgcodex
Menu
Page tools

codex · Philosophy

Completeness (logic)

In mathematical logic and metalogic, a formal system is called complete with respect to a particular property if every formula having the property can be derived using that system, i.e. is one of its theorems; otherwise the system is said to be incomplete. The term "complete" is also used without qualification, with differing meanings depending on the context, mostly referring to the property of semantic validity. Intuitively, a system is called complete in this particular sense, if it can derive every formula that is true.

Wikipedia contributors, "Completeness (logic)", Wikipedia, revision 1366724216, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex