138 reputation
5
bio website alexraasch.de
location Germany
age 33
visits member for 1 year, 11 months
seen Oct 31 '13 at 11:45

I'm an information management consultant at a small IT company that develops and sells an ERP system for municipal utilities and power traders. My work mostly consists of conducting projects regarding electronic archiving, workflow applications and compliance.


Oct
4
awarded  Popular Question
Oct
31
awarded  Autobiographer
Dec
29
comment Proof of the Compactness Theorem for Propositional Logic
I accepted your answer but I still don't get it. There are too many symbols to keep in my head at the same time. :) I'll keep trying.
Dec
29
awarded  Scholar
Dec
29
accepted Proof of the Compactness Theorem for Propositional Logic
Dec
29
comment Proof of the Compactness Theorem for Propositional Logic
Ok, I have to admit your proof is too hard for me to digest. I think the basic idea is to say that every formula $\phi$ has only finitely many propositional variables. Let $n$ be that number. Then $\phi$ belongs to $S_n$, which has a model. So there is a model for every $\phi$ in $S$. Therefore, $S$ has a model.
Dec
29
awarded  Supporter
Dec
29
comment Proof of the Compactness Theorem for Propositional Logic
Sorry, I can't access the page you linked, none of the images are loaded due to some authorization error.
Dec
27
comment Proof of the Compactness Theorem for Propositional Logic
In your 3rd paragraph, how do you decide if $T_1$ is infinite?
Dec
27
awarded  Student
Dec
27
comment Proof of the Compactness Theorem for Propositional Logic
Thanks, you're right. I read the FAQ after posting the question.
Dec
26
asked Proof of the Compactness Theorem for Propositional Logic