Vol. 71, No. 1, 1977

Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Concerning partial recursive similarity transformations of linearly ordered sets

Louise Hay, Alfred Berry Manaster and Joseph Goeffrey Rosenstein

Vol. 71 (1977), No. 1, 57–70
Abstract

Interesting contrasts between uncountable suborderings of the continuum and denumerable linear orderings are provided by results of Dushnik and Miller and Sierpiński on the one hand and Laver on other. We investigate analogues of these results in a recursive setting where the only similarity maps are restrictions of partial recursive functions. Complements of recursively enumerable bi-dense subsets of the rationals of arbitrary nonzero degree of unsolvability are shown to bear a strong resemblance to uncountable suborderings of the continuum.

Mathematical Subject Classification 2000
Primary: 02F25, 02F25
Secondary: 06A05
Milestones
Received: 8 June 1976
Published: 1 July 1977
Authors
Louise Hay
Alfred Berry Manaster
Joseph Goeffrey Rosenstein