Partial orders and immunity in reverse mathematics - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue Computability Année : 2018

Partial orders and immunity in reverse mathematics

Résumé

We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a larger program of unification of the separation proofs of various Ramsey-type theorems in reverse mathematics in order to obtain a better understanding of the combinatorics of Ramsey's theorem and its consequences. We also answer a question of Murakami, Yamazaki and Yokoyama about pseudo Ramsey's theorem for pairs.
Fichier principal
Vignette du fichier
partial-orders-long.pdf (245.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01888773 , version 1 (05-10-2018)

Identifiants

Citer

Ludovic Patey. Partial orders and immunity in reverse mathematics. Computability, 2018, 7 (4), pp.323-339. ⟨10.3233/COM-170071⟩. ⟨hal-01888773⟩
16 Consultations
59 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More