Reverse mathematics and the equivalence of definitions for well and better quasi-orders

Journal of Symbolic Logic 69 (3):683-712 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.
Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
Interval Orders and Reverse Mathematics.Alberto Marcone - 2007 - Notre Dame Journal of Formal Logic 48 (3):425-448.

Analytics

Added to PP
2009-02-05

Downloads
32 (#452,852)

6 months
4 (#477,225)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Ordinal numbers and the Hilbert basis theorem.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (3):961-974.
Computability theory and linear orders.Rod Downey - 1998 - In I͡Uriĭ Leonidovich Ershov (ed.), Handbook of Recursive Mathematics. Elsevier. pp. 138--823.
Infinite chains and antichains in computable partial orderings.E. Herrmann - 2001 - Journal of Symbolic Logic 66 (2):923-934.

Add more references