Degrees bounding principles and universal instances in reverse mathematics

Annals of Pure and Applied Logic 166 (11):1165-1185 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

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

Inductive inference and reverse mathematics.Rupert Hölzl, Sanjay Jain & Frank Stephan - 2016 - Annals of Pure and Applied Logic 167 (12):1242-1266.
Reverse Mathematics and parameter-free Transfer.Benno van den Berg & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (3):273-296.
Reverse mathematics and properties of finite character.Damir D. Dzhafarov & Carl Mummert - 2012 - Annals of Pure and Applied Logic 163 (9):1243-1251.
Derivatives of normal functions in reverse mathematics.Anton Freund & Michael Rathjen - 2021 - Annals of Pure and Applied Logic 172 (2):102890.
Dominating the Erdős–Moser theorem in reverse mathematics.Ludovic Patey - 2017 - Annals of Pure and Applied Logic 168 (6):1172-1209.
On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.

Analytics

Added to PP
2015-08-28

Downloads
85 (#653,050)

6 months
19 (#603,192)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Dominating the Erdős–Moser theorem in reverse mathematics.Ludovic Patey - 2017 - Annals of Pure and Applied Logic 168 (6):1172-1209.

Add more citations

References found in this work

Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..

View all 18 references / Add more references