A consistent set of first-order sentences is maximal when adding any new sentence makes it inconsistent. It is then deductively closed and decides every sentence by containing exactly one of it and its negation. Conversely a consistent deductively closed set that decides every sentence is maximal. Merely listing a finite axiom set for a complete theory does not make that raw list maximal: maximality applies to the deductive closure.
A first-order consistent theory is maximally consistent when it has no proper consistent extension in its fixed language. It decides each first-order sentence or its negation.

Ancestors (8)

  1. Consistent first-order theory
  2. First-order theory
  3. First-order logic
  4. Mathematical logic
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8. Home

Incoming links (1)

Synonyms (1)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version