- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Review: C. Spector, Hyperarithmetical Quantifiers; Shih-Chao Liu, Recursive Linear Orderings and Hyperarithmetical Functions. [REVIEW]Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (1):137-137.
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.
Up to equimorphism, hyperarithmetic is recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360-378.
Review: Richard Friedberg, The Uniqueness of Finite Division for Recursive Equivalence Types. [REVIEW]Marian Boykan Pour-El - 1960 - Journal of Symbolic Logic 25 (4):363-363.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Analytics
Added to PP
2009-01-28
Downloads
35 (#121,482)
6 months
7 (#1,397,300)
2009-01-28
Downloads
35 (#121,482)
6 months
7 (#1,397,300)
Historical graph of downloads
Citations of this work
Intrinsic bounds on complexity and definability at limit levels.John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Sara Quinn - 2009 - Journal of Symbolic Logic 74 (3):1047-1060.
Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo