Linear orders with distinguished function symbol

, &
Archive for Mathematical Logic 48 (1):63-76 (2009)
  Copy   BIBTEX

Abstract

We consider certain linear orders with a function on them, and discuss for which types of functions the resulting structure is or is not computably categorical. Particularly, we consider computable copies of the rationals with a fixed-point free automorphism, and also ω with a non-decreasing function

Categories

Keywords

Reprint years

DOI

10.1007/s00153-008-0112-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
Π⁰₁ classes with complex elements.Stephen Binns - 2008 - Journal of Symbolic Logic 73 (4):1341-1353.
On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
The complexity of the collection of countable linear orders of the form I + I.Ferenc Beleznay - 1999 - Journal of Symbolic Logic 64 (4):1519-1526.
Countably categorical coloured linear orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.
On a Question of Phillips.Çiǧdem Gencer & Mehmet Terziler - 1997 - Mathematical Logic Quarterly 43 (1):78-82.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
Decidable discrete linear orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
Extending partial orders to dense linear orders.Theodore A. Slaman & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 94 (1-3):253-261.
Adding linear orders.Saharon Shelah & Pierre Simon - 2012 - Journal of Symbolic Logic 77 (2):717-725.
The maximal linear extension theorem in second order arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
$\Pi _{1}^{0}$ Classes with Complex Elements.Stephen Binns - 2008 - Journal of Symbolic Logic 73 (4):1341 - 1353.

Analytics

Added to PP
2013-12-01

Downloads
83 (#202,545)

6 months
8 (#361,319)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Recursively rigid Boolean algebras.Jeffrey B. Remmel - 1987 - Annals of Pure and Applied Logic 36:39-52.

Add more references