Timeline for Showing that every satisfiable sentence with at most two variables has a finite model
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 3, 2011 at 0:06 | comment | added | user3462 | citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.9859 seems to have a proof, but the book recommended by boumol is probably better. As an aside, I'm not sure the exercises from Wilfrid Hodges' book are always to be solved. If I remember correctly, the Borel determinacy theorem is a subpart of an exercise in which he introduces Banach-Mazur games in his book 'Building Models by Games'. | |
| Nov 2, 2011 at 23:03 | comment | added | boumol | The classical source to look for this kind of questions is the book "The Classical Decision Problem" by Borger-Gradel-Gurevich; I am sure there you can find a proof of this result. This particular result, when equality symbol is allowed, was firstly proved by Mortimer in his paper "On languages with two variables" (without equality symbol this was previously proved by Danna Scott in an abstract published at JSL). | |
| Nov 2, 2011 at 21:20 | history | edited | anonymous | CC BY-SA 3.0 |
added 4 characters in body
|
| Nov 2, 2011 at 20:48 | history | edited | anonymous | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Nov 2, 2011 at 20:31 | history | edited | anonymous | CC BY-SA 3.0 |
added 28 characters in body
|
| Nov 2, 2011 at 20:26 | history | edited | François G. Dorais | CC BY-SA 3.0 |
added 18 characters in body; edited title
|
| Nov 2, 2011 at 20:25 | history | rollback | François G. Dorais |
Rollback to Revision 4
|
|
| Nov 2, 2011 at 20:23 | history | edited | anonymous | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Nov 2, 2011 at 20:23 | history | edited | François G. Dorais | CC BY-SA 3.0 |
capitalization; typos
|
| Nov 2, 2011 at 20:22 | history | edited | anonymous | CC BY-SA 3.0 |
added 24 characters in body; edited tags
|
| Nov 2, 2011 at 19:54 | history | edited | anonymous | CC BY-SA 3.0 |
added 68 characters in body; edited title
|
| Nov 2, 2011 at 19:39 | comment | added | Gerhard Paseman | Also, it would help if you mention which language. I suspect there are counterexamples (Austin identities?) in second order logic. Gerhard "Ask Me About System Design" Paseman, 2011.11.02 | |
| Nov 2, 2011 at 19:37 | comment | added | Gerhard Paseman | If you mention more about your attempts, you may find someone sympathetic enough to help. Although this is likely a graduate level problem, some might consider it not research level and close the question as being too localized. I hope that it stays open, especially if you provde more motivation and a reasonable summary of your attempts. Gerhard "Ask Me About System Design" Paseman, 2011.11.02 | |
| Nov 2, 2011 at 19:16 | history | asked | anonymous | CC BY-SA 3.0 |