Strong reductions between combinatorial principles

Journal of Symbolic Logic 81 (4):1405-1431 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2016.1

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,804

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

D. D. Dzhafarov and C. Mummert, Reverse Mathematics: Problems, Reductions, and Proofs. Theory and Applications of Computability. Springer Nature, Cham, 2022, xix + 488 pp. [REVIEW]Chris J. Conidis - 2023 - Bulletin of Symbolic Logic 29 (4):660-662.
Formal Reductions of the General Combinatorial Decision Problem.Emil L. Post - 1943 - Journal of Symbolic Logic 8 (1):50-52.
Review: Emil L. Post, Formal Reductions of the General Combinatorial Decision Problem. [REVIEW]Alonzo Church - 1943 - Journal of Symbolic Logic 8 (1):50-52.
Ideals and combinatorial principles.Douglas Burke & Yo Matsubara - 1997 - Journal of Symbolic Logic 62 (1):117-122.
Post Emil L.. Formal reductions of the general combinatorial decision problem. American journal of mathematics, vol. 65 , pp. 197–215. [REVIEW]Alonzo Church - 1943 - Journal of Symbolic Logic 8 (2):50-52.
The definability strength of combinatorial principles.Wei Wang - 2016 - Journal of Symbolic Logic 81 (4):1531-1554.
Strong termination for the epsilon substitution method.Grigori Mints - 1996 - Journal of Symbolic Logic 61 (4):1193-1205.
Subcompact Cardinals, Type Omission, and Ladder Systems.Yair Hayut & Menachem Magidor - 2022 - Journal of Symbolic Logic 87 (3):1111-1129.
A combinatorial property of the homomorphism relation between countable order types.Charles Landraitis - 1979 - Journal of Symbolic Logic 44 (3):403-411.
The combinatorial essence of supercompactness.Christoph Weiß - 2012 - Annals of Pure and Applied Logic 163 (11):1710-1717.

Analytics

Added to PP
2018-02-09

Downloads
11 (#1,502,069)

6 months
2 (#1,378,640)

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

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.

Add more references