OurBigBook About$ Donate
 Sign in Sign up

Syntactic proof of first-order compactness

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic First-order logic Compactness theorem
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
If a theory were inconsistent, a proof of contradiction would use a finite inconsistent subset. Therefore consistency of every finite subset implies consistency of the whole theory, and completeness supplies a model.

 Ancestors (7)

  1. Compactness theorem
  2. First-order logic
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook