How can I prove the compactness theorem for sets of sentences?

  • Level: Graduate 
  • Thread starter Thread starter rainwyz0706
  • Start date Start date
  • Tags Tags
    Proof Theorem
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
Sign up Log in
1 reply · 2K views
rainwyz0706
Messages
34
Reaction score
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!
 
Physics news on Phys.org

Discussion

My advice would be to not try to reinvent the wheel, and study the proofs given in any logic textbook.
 

Similar threads

Compactness Theorem: Intersection of Compact Sets
  • alyafey22
  • · Replies 5 ·
  • Topology and Analysis
Replies
5
Topology Compactness Theorem: Hausdorff and Compact Topologies on a Set X
  • economist13
  • · Replies 8 ·
  • Calculus and Beyond Homework Help
Replies
8
Graduate How can I prove that X is COUNTABLY compact?
  • synergy
  • · Replies 4 ·
  • Set Theory, Logic, Probability, Statistics
Replies
4
Graduate How can I prove the Riesz representation theorem?
  • Fredrik
  • · Replies 12 ·
  • Linear and Abstract Algebra
Replies
12
Undergrad How Can I Prove Limits Using the Squeeze Theorem?
  • honestrosewater
  • · Replies 8 ·
  • Calculus
Replies
8
Graduate How Can I Prove That QxQ is Disconnected and Totally Disconnected in R²?
  • Dani4941
  • · Replies 6 ·
  • Calculus
Replies
6