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

  • Thread starter Thread starter rainwyz0706
  • Start date Start date
  • Tags Tags
    Proof Theorem
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
My advice would be to not try to reinvent the wheel, and study the proofs given in any logic textbook.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...

Similar threads

Replies
3
Views
2K
Replies
3
Views
3K
Replies
5
Views
2K
Replies
2
Views
2K
Replies
6
Views
2K
Replies
5
Views
2K
Back
Top