Timeline for How to show that the set of universal sentences with infinite models is a decidable set?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 3, 2017 at 14:36 | review | Close votes | |||
| Jul 4, 2017 at 15:08 | |||||
| Jul 3, 2017 at 14:09 | comment | added | Emil Jeřábek | The statement is false. For example, given a sentence $\psi$ in the language of arithmetic, the Skolemization of $Q+\psi$ (which is a universal sentence, computable from $\psi$) has an infinite model iff $Q+\psi$ is consistent, hence your statement would imply that $Q$ is decidable. | |
| Jul 3, 2017 at 14:06 | comment | added | Wojowu | Where did you find this statement? | |
| Jul 3, 2017 at 13:55 | review | First posts | |||
| Jul 3, 2017 at 13:57 | |||||
| Jul 3, 2017 at 13:52 | history | asked | LearningProcess | CC BY-SA 3.0 |