A generalization of tennenbaum's theorem on effectively finite recursive linear orderings

Journal of Symbolic Logic 49 (2):563-569 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,024

External links

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

Through your library

Similar books and articles

A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Recursive automorphisms of recursive linear orderings.Steven Schwarz - 1984 - Annals of Pure and Applied Logic 26 (1):69-73.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
No Escape from Vardanyan's theorem.Albert Visser & Maartje de Jonge - 2006 - Archive for Mathematical Logic 45 (5):539-554.

Analytics

Added to PP
2009-01-28

Downloads
56 (#398,442)

6 months
15 (#169,459)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references