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

Journal of Symbolic Logic 49 (2):563-569 (1984)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274189
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,756
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Generalizations of Kochen and Specker's Theorem and the Effectiveness of Gleason's Theorem.Itamar Pitowsky - 2004 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 35 (2):177-194.
Recursive Linear Orderings and Hyperarithmetical Functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
A Coding of the Countable Linear Orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
The Philosophical Significance of Tennenbaum's Theorem.T. Button & P. Smith - 2012 - Philosophia Mathematica 20 (1):114-121.
A Recursion Principle for Linear Orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
A Construction for Recursive Linear Orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.

Monthly downloads

Added to index

2009-01-28

Total downloads

5 ( #604,007 of 2,178,126 )

Recent downloads (6 months)

1 ( #316,663 of 2,178,126 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums