Compactness theorem proof

  • #1
rainwyz0706
36
0
An expression of the compactness theorem for sets of sentences is that: let T be a set of sentences in L. Then T has a model iff every finite subset of T has a model.
Could anyone give me some hints how to prove this?
The first direction is straightforward: every model of T is a model of every subset of T. But what about the opposite direction? Any help is appreciated!
 

Answers and Replies

  • #2
JSuarez
402
1
My advice would be to not try to reinvent the wheel, and study the proofs given in any logic textbook.
 

Suggested for: Compactness theorem proof

I Martingale, Optional sampling theorem
  • Last Post
Replies
6
Views
145
A Uncertainties on Bayes' theorem
  • Last Post
Replies
19
Views
849
MHB Set proof
  • Last Post
Replies
5
Views
681
MHB Proof of a set union and intersection
  • Last Post
Replies
1
Views
353
I Bayesian Stats: Resources about Mercer's Theorem for Gaussian Processes
  • Last Post
Replies
0
Views
383
MHB Logic Proof With Rules of Replacement
  • Last Post
Replies
1
Views
760
I Proof of ## \displaystyle\sum_{n=0}^\infty \frac{nX^n}{n!}= Xe^X##
  • Last Post
Replies
8
Views
557
I Is this statement an aspect of the Hairy Ball or Fixed Point Theorem?
  • Last Post
Replies
1
Views
391
I An easy proof of Gödel's first incompleteness theorem?
  • Last Post
Replies
16
Views
1K
MHB Turans Theorem (Dual?)
  • Last Post
Replies
1
Views
974

Hot Threads

Recent Insights

Top