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)

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1096901762

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 105,810

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

Reverse Mathematics and Partial Orders, University of Udine, Italy, 2014. Supervised by Alberto Marcone.Emanuele Frittaion - 2018 - Bulletin of Symbolic Logic 24 (2):196-196.
Reverse mathematics, well-quasi-orders, and Noetherian spaces.Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer & Jeroen Van der Meeren - 2016 - Archive for Mathematical Logic 55 (3):431-459.
Provable Better-Quasi-Orders.Anton Freund, Alberto Marcone, Fedor Pakhomov & Giovanni Soldà - 2025 - Notre Dame Journal of Formal Logic -1:1-14.
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
The maximal linear extension theorem in second order arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
Interval Orders and Reverse Mathematics.Alberto Marcone - 2007 - Notre Dame Journal of Formal Logic 48 (3):425-448.
Reverse mathematics, young diagrams, and the ascending chain condition.Kostas Hatzikiriakou & Stephen G. Simpson - 2017 - Journal of Symbolic Logic 82 (2):576-589.
On the existence of large antichains for definable quasi-orders.Benjamin D. Miller & Zoltán Vidnyánszky - 2020 - Journal of Symbolic Logic 85 (1):103-108.
Ordinal inequalities, transfinite induction, and reverse mathematics.Jeffry Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.

Analytics

Added to PP
2009-02-05

Downloads
59 (#397,904)

6 months
11 (#332,407)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.

View all 11 citations / Add more citations

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︠U︡riĭ Leonidovich Ershov, Handbook of recursive mathematics. New York: 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