Recursice well-founded orderings

Annals of Mathematical Logic 13 (2):117 (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

The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
Belief Revision and Verisimilitude.Mark Ryan & Pierre-Yves Schobbens - 1995 - Notre Dame Journal of Formal Logic 36 (1):15-29.
Lecture notes on term rewriting and computational complexity.Harvey Friedman - manuscript
Fregean hierarchies and mathematical explanation.Michael Detlefsen - 1988 - International Studies in the Philosophy of Science 3 (1):97 – 116.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
Weak comparability of well orderings and reverse mathematics.Harvey M. Friedman & Jeffry L. Hirst - 1990 - Annals of Pure and Applied Logic 47 (1):11-29.
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 recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Dynamic Choice Mechanisms.Ludwig von Auer - 1999 - Theory and Decision 46 (3):295-312.
Fair social orderings.Marc Fleurbaey & F. Maniquet - unknown
The Number of Preference Orderings: A Recursive Approach.Ben Eggleston - 2015 - The Mathematical Gazette 99 (544):21-32.
Order-isomorphic η 1 -orderings in Cohen extensions.Bob A. Dumas - 2009 - Annals of Pure and Applied Logic 158 (1-2):1-22.

Analytics

Added to PP
2015-02-05

Downloads
5 (#1,514,558)

6 months
1 (#1,516,429)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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 recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
A generalization of the limit lemma and clopen games.Peter Clote - 1986 - Journal of Symbolic Logic 51 (2):273-291.

Add more citations

References found in this work

No references found.

Add more references