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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesItamar Pitowsky (2004). Generalizations of Kochen and Specker's Theorem and the Effectiveness of Gleason's Theorem. Studies in History and Philosophy of Science Part B 35 (2):177-194.
Louis M. Guenin (2001). The Set Theoretic Ambit of Arrow's Theorem. Synthese 126 (3):443 - 472.
Shih-Chao Liu (1962). Recursive Linear Orderings and Hyperarithmetical Functions. Notre Dame Journal of Formal Logic 3 (3):129-132.
Patrick Dehornoy (1990). A Coding of the Countable Linear Orderings. Studia Logica 49 (4):585 - 590.
T. Button & P. Smith (2012). The Philosophical Significance of Tennenbaum's Theorem. Philosophia Mathematica 20 (1):114-121.
Juliette Kennedy & Roman Kossak (eds.) (2012). Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies. Cambridge University Press.
Juha Oikkonen (1992). A Recursion Principle for Linear Orderings. Journal of Symbolic Logic 57 (1):82-96.
Antonio Montalbán (2005). Up to Equimorphism, Hyperarithmetic Is Recursive. Journal of Symbolic Logic 70 (2):360 - 378.
Dev K. Roy & Richard Watnick (1988). Finite Condensations of Recursive Linear Orders. Studia Logica 47 (4):311 - 317.
C. J. Ash (1991). A Construction for Recursive Linear Orderings. Journal of Symbolic Logic 56 (2):673-683.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #201,838 of 549,065 )Recent downloads (6 months)1 ( #63,185 of 549,065 )How can I increase my downloads? |
My notes
Discussion
