Timeline for Arithmetic of ordered sets more general than ordinals
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 14, 2010 at 10:18 | comment | added | Antonio E. Porreca | Joel, me and one of my colleagues were just toying with that idea; we’re not sure about the interpretation either (except maybe for a “universe without a beginning” where time has the same order type as ℤ). | |
| Sep 13, 2010 at 2:14 | answer | added | Aaron Sterling | timeline score: 1 | |
| Sep 12, 2010 at 23:43 | answer | added | Yuval Filmus | timeline score: 3 | |
| Sep 12, 2010 at 16:30 | comment | added | Joel David Hamkins | Antonio, are you proposing in particular to extend Turing machine operation into non-well-founded time? This is very interesting, but I am not clear on what it would mean. Meanwhile, Peter Koepke has extended infinite time Turing machines to use ordinal-length tapes, and quite successfully analyzed their power. | |
| Sep 12, 2010 at 14:58 | history | edited | Antonio E. Porreca |
edited tags
|
|
| Sep 12, 2010 at 14:01 | comment | added | Henno Brandsma | I second Rosenstein (he indeed defines sum and product for all ordered spaces, and does some theory on them). | |
| Sep 12, 2010 at 11:44 | comment | added | Yuval Filmus | A nice book on ordered sets is "Linear orderings" by Rosenstein. | |
| Sep 12, 2010 at 10:04 | history | asked | Antonio E. Porreca | CC BY-SA 2.5 |