Computability in Europe 2008
Logic and Theory of Algorithms
|Speaker:||Herman Ruge Jervell|
|Slot:||Thu, 11:20-11:40, Amphitheater B (col. 2)|
Previously --- in CiE 2005 --- we have given an ordering of finite trees and showed that it is a well ordering reaching up to the small Veblen ordinal. Here we extend this ordering to finite labeled trees --- similar to Takeuti's ordinal diagrams --- and show that this extended ordering is also a well ordering.
|websites: Arnold Beckmann||2008-05-19|