# Arithmetic of ordered sets more general than ordinals

Motivation. Having read about infinite time Turing machines and ω-languages, I was thinking about more general notions of languages and “computation time”. Languages over strings of length greater than ω seem reasonably easy to define, and using larger ordinals to measure time is quite standard.

However, I’m interested in more general, non necessarily well-founded ordered sets. Using ordered sets to keep track of time seems to require suitable notions of arithmetic operations. For example, it’s easy to generalise sum and multiplication of ordinals to arbitrary totally ordered sets (though, of course, these operations are not defined by transfinite recursion); I’m not sure about exponentiation and other operations.

Question. Is there any good literature about arithmetic of (some classes of) non well-founded ordered sets?

-
A nice book on ordered sets is "Linear orderings" by Rosenstein. –  Yuval Filmus Sep 12 '10 at 11:44
I second Rosenstein (he indeed defines sum and product for all ordered spaces, and does some theory on them). –  Henno Brandsma Sep 12 '10 at 14:01
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. –  Joel David Hamkins Sep 12 '10 at 16:30
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 ℤ). –  Antonio E. Porreca Sep 14 '10 at 10:18