Computability theory and linear orders

In I͡Uriĭ Leonidovich Ershov (ed.), Handbook of Recursive Mathematics. Elsevier. pp. 138--823 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,649

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Adding Linear Orders.Saharon Shelah & Pierre Simon - 2012 - Journal of Symbolic Logic 77 (2):717-725.
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.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
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.
Decidable Discrete Linear Orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.
Nonexistence of Universal Orders in Many Cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
Countably Categorical Coloured Linear Orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.

Analytics

Added to PP
2014-01-27

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

No references found.

Add more references