Recursive well-founded orderings

Annals of Mathematical Logic 13 (2):117-147 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(78)90001-3

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.Arnold Beckmann - 2002 - Archive for Mathematical Logic 41 (3):251-257.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
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.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Recursive automorphisms of recursive linear orderings.Steven Schwarz - 1984 - Annals of Pure and Applied Logic 26 (1):69-73.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Hierarchies over recursive well-orderings.Herbert Enderton & David Luckham - 1964 - Journal of Symbolic Logic 29 (4):183-190.
Review: Clifford Spector, Recursive Well-Orderings. [REVIEW]Werner Markwald - 1956 - Journal of Symbolic Logic 21 (4):412-413.
Four types of general recursive well-orderings.Shih Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (2):75-78.
Review: Joseph Harrison, Recursive Pseudo-well-Orderings. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (1):197-198.
Belief Revision and Verisimilitude.Mark Ryan & Pierre-Yves Schobbens - 1995 - Notre Dame Journal of Formal Logic 36 (1):15-29.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.

Analytics

Added to PP
2014-01-17

Downloads
7 (#1,356,784)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.
Borel ideals vs. Borel sets of countable relations and trees.Samy Zafrany - 1989 - Annals of Pure and Applied Logic 43 (2):161-195.
On the ranked points of a Π1 0 set.Douglas Cenzer & Rick L. Smith - 1989 - Journal of Symbolic Logic 54 (3):975-991.
A generalization of the limit lemma and clopen games.Peter Clote - 1986 - Journal of Symbolic Logic 51 (2):273-291.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.

Add more citations

References found in this work

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.
A note on many·one reducibility.Shih-Chao Liu - 1963 - Journal of Symbolic Logic 28 (2):143-153.
A note on many·one reducibility.Shih-Chao Liu - 1963 - Journal of Symbolic Logic 28 (1):35-42.

View all 6 references / Add more references