David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jonathan Jenkins Ichikawa
Jack Alan Reynolds
Learn more about PhilPapers
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Juha Oikkonen & Jouko Väänänen (1993). Game-Theoretic Inductive Definability. Annals of Pure and Applied Logic 65 (3):265-306.
Xavier Caicedo (1996). X Latin American Symposium on Mathematical Logic. Association for Symbolic Logic: The Bulletin of Symbolic Logic 2 (2):214-237.
Similar books and articles
Antonio Montalbán (2007). On the Equimorphism Types of Linear Orderings. Bulletin of Symbolic Logic 13 (1):71-99.
Patrick Dehornoy (1990). A Coding of the Countable Linear Orderings. Studia Logica 49 (4):585 - 590.
Antonio Montalbán (2005). Up to Equimorphism, Hyperarithmetic Is Recursive. Journal of Symbolic Logic 70 (2):360 - 378.
Juha Oikkonen (1990). On Ehrenfeucht-Fraïssé Equivalence of Linear Orderings. Journal of Symbolic Logic 55 (1):65-73.
Ursula Martin & Elizabeth Scott (1997). The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets. Journal of Symbolic Logic 62 (2):624-635.
Paul Bankston & Wim Ruitenburg (1990). Notions of Relative Ubiquity for Invariant Sets of Relational Structures. Journal of Symbolic Logic 55 (3):948-986.
Shih-Chao Liu (1962). Recursive Linear Orderings and Hyperarithmetical Functions. Notre Dame Journal of Formal Logic 3 (3):129-132.
Richard Watnick (1984). A Generalization of Tennenbaum's Theorem on Effectively Finite Recursive Linear Orderings. Journal of Symbolic Logic 49 (2):563-569.
Paul R. Young (1966). Linear Orderings Under One-One Reducibility. Journal of Symbolic Logic 31 (1):70-85.
C. J. Ash (1991). A Construction for Recursive Linear Orderings. Journal of Symbolic Logic 56 (2):673-683.
Added to index2009-01-28
Total downloads10 ( #410,793 of 1,932,585 )
Recent downloads (6 months)1 ( #456,398 of 1,932,585 )
How can I increase my downloads?