Timeline for Normal form in second-order logic
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2014 at 5:54 | history | edited | Michael Hardy | CC BY-SA 3.0 |
edited body; edited title
|
| Dec 10, 2012 at 10:53 | vote | accept | Deb | ||
| Nov 1, 2012 at 11:20 | answer | added | Emil Jeřábek | timeline score: 4 | |
| Nov 1, 2012 at 0:10 | comment | added | Joel David Hamkins | What prevents a trivial solution: if $S$ is a valid sentence, then take $S'$ to be $\forall x\ x=x$, and if not, then take $S'$ to be an invalid sentence in your desired form. | |
| Oct 30, 2012 at 6:08 | history | asked | Deb | CC BY-SA 3.0 |