Timeline for Can we prove the completeness of FOL based on forcing?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 19, 2012 at 18:11 | comment | added | Emil Jeřábek | @Chao: If you know how to prove completeness using Henkin completion, and you know how to recast Henkin completion for countable theories as a forcing construction in the proof of compactness, you can do exactly the same thing with Henkin completion in the proof of completeness. What is your question then? | |
| Dec 18, 2012 at 13:51 | comment | added | Carl Mummert | I have voted to close this question; it is on scope for MSE but I do not think it is the sort of "research level" question that this site is intended for. Even if the question is closed here it can be answered in detail on MSE. | |
| Dec 18, 2012 at 13:25 | comment | added | Chao Chen | @Emil I know Henkin construction can be used to prove the completeness, my question is about to "rewrite" the proof in forcing language. | |
| Dec 18, 2012 at 13:04 | comment | added | Emil Jeřábek | The Henkin construction can be used to prove the completeness theorem as well as compactness, in fact it was invented for that very purpose. You should find this in any textbook on logic which is not specifically targeted on model theory, and so does not try to avoid syntax at all costs. | |
| Dec 18, 2012 at 9:10 | comment | added | Chao Chen | I added [forcing] tag to the MSE question. Sorry for my impatience, I just forget the time difference. | |
| Dec 18, 2012 at 8:36 | comment | added | Asaf Karagila♦ | Five hours is not even a full night sleep for many people in the world. So you have waited that long? Oh dear. Also, you may want to add [forcing] tag to the MSE question. For completeness of the post, here is a link to the MSE post: math.stackexchange.com/questions/261162/… | |
| Dec 18, 2012 at 7:49 | history | asked | Chao Chen | CC BY-SA 3.0 |