Journal of Symbolic Logic 57 (1):82-96 (1992)
The idea of this paper is to approach linear orderings as generalized ordinals and to study how they are made from their initial segments. First we look at how the equality of two linear orderings can be expressed in terms of equality of their initial segments. Then we shall use similar methods to define functions by recursion with respect to the initial segment relation. Our method is based on the use of a game where smaller and smaller initial segments of linear orderings are considered. The length of the game is assumed to exceed that of the descending sequences of elements of the linear orderings considered. By use of such game-theoretical methods we can for example extend the recursive definitions of the operations of sum, product and exponentiation of ordinals in a unique and natural way for arbitrary linear orderings. Extensions coming from direct limits do not satisfy our game-theoretic requirements in general. We also show how our recursive definitions allow very simple constructions for fixed points of functions, giving rise to certain interesting linear orderings
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Game-Theoretic Inductive Definability.Juha Oikkonen & Jouko Väänänen - 1993 - Annals of Pure and Applied Logic 65 (3):265-306.
X Latin American Symposium on Mathematical Logic.Xavier Caicedo - 1996 - Association for Symbolic Logic: The Bulletin of Symbolic Logic 2 (2):214-237.
X Latin American Symposium on Mathematical Logic.Xavier Caicedo - 1996 - Bulletin of Symbolic Logic 2 (2):214-237.
Similar books and articles
On the Equimorphism Types of Linear Orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
Linear Orderings Under One-One Reducibility.Paul R. Young - 1966 - Journal of Symbolic Logic 31 (1):70-85.
A Generalization of Tennenbaum's Theorem on Effectively Finite Recursive Linear Orderings.Richard Watnick - 1984 - Journal of Symbolic Logic 49 (2):563-569.
Recursive Linear Orderings and Hyperarithmetical Functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Notions of Relative Ubiquity for Invariant Sets of Relational Structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
On Ehrenfeucht-Fraïssé Equivalence of Linear Orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
A Coding of the Countable Linear Orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Added to index2009-01-28
Total downloads10 ( #429,057 of 2,164,542 )
Recent downloads (6 months)1 ( #347,971 of 2,164,542 )
How can I increase my downloads?