Timeline for Does the exact pair phenomenon for partial orders occur in your area of mathematics?
Current License: CC BY-SA 2.5
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 27, 2016 at 13:38 | answer | added | Todd Trimble | timeline score: 3 | |
Feb 26, 2016 at 15:02 | answer | added | Tristan Bice | timeline score: 6 | |
Jun 17, 2010 at 8:43 | answer | added | T.. | timeline score: 5 | |
Apr 23, 2010 at 7:35 | answer | added | Charles Stewart | timeline score: 3 | |
Apr 23, 2010 at 2:54 | answer | added | Jacques Carette | timeline score: 3 | |
Apr 22, 2010 at 19:52 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
Improved formatting, added explanation
|
Apr 21, 2010 at 9:30 | comment | added | Charles Stewart | I understand that the theorem is due to Spector (1956) On degrees of recursive unsolvability, Annals of Mathematics 64:581-592. It's a very nice theorem: Shore stresses its use in eliminating second-order quantification. | |
Apr 21, 2010 at 4:40 | comment | added | Andrej Bauer | I don't have much to say here, except that the poset $P = \mathbb{N} \cup \lbrace\infty_1,\infty_2\rbrace$ with the usual ordering on the natural numbers and the additional stipulations $n \leq \infty_1$, $n \leq \infty_2$ often serves as a counter-example in domain theory. | |
Apr 20, 2010 at 18:33 | history | edited | Joel David Hamkins | CC BY-SA 2.5 |
added 61 characters in body; edited title; added 163 characters in body
|
Apr 20, 2010 at 18:23 | history | asked | Joel David Hamkins | CC BY-SA 2.5 |