Number theoretic concepts and recursive well-orderings

Archive for Mathematical Logic 5 (1-2):42-64 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

The Number of Preference Orderings: A Recursive Approach.Ben Eggleston - 2015 - The Mathematical Gazette 99 (544):21-32.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
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.
Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.

Analytics

Added to PP
2020-12-03

Downloads
12 (#1,049,421)

6 months
7 (#411,145)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references