default search action
Ludovic Patey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Benoit Monin, Ludovic Patey
:
Partition Genericity and Pigeonhole Basis theorems. J. Symb. Log. 89(2): 829-857 (2024) - [j22]Julien Cervelle, William Gaudelier, Ludovic Patey
THE REVERSE MATHEMATICS OF ${\mathsf {CAC\ FOR\ TREES}}$. J. Symb. Log. 89(3): 1189-1211 (2024) - [e1]Ludovic Levy Patey
Twenty Years of Theoretical and Practical Synergies - 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8-12, 2024, Proceedings. Lecture Notes in Computer Science 14773, Springer 2024, ISBN 978-3-031-64308-8 [contents] - [i1]Quentin Le Houérou, Ludovic Levy Patey, Ahmed Mimouni:
The reverse mathematics of the pigeonhole hierarchy. CoRR abs/2407.01236 (2024) - 2023
- [j21]Paul-Elliot Anglès d'Auriac, Lu Liu, Bastien Mignoty, Ludovic Patey
Carlson-Simpson's lemma and applications in reverse mathematics. Ann. Pure Appl. Log. 174(9): 103287 (2023) - 2022
- [j20]Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky:
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87(1): 47-71 (2022) - [j19]Ludovic Patey
Ramsey-like theorems and moduli of Computation. J. Symb. Log. 87(1): 72-108 (2022) - [j18]Lu Liu
The Reverse Mathematics of the thin Set and ERDőS-Moser theorems. J. Symb. Log. 87(1): 313-346 (2022) - 2021
- [j17]Damir D. Dzhafarov
COH, SRT22, and multiple functionals. Comput. 10(2): 111-121 (2021) - [j16]Benoit Monin, Ludovic Patey:
The weakness of the pigeonhole principle under hyperarithmetical reductions. J. Math. Log. 21(3): 2150013:1-2150013:41 (2021) - 2020
- [j15]Damir D. Dzhafarov
Ramsey's theorem and products in the Weihrauch degrees. Comput. 9(2): 85-110 (2020) - [j14]Peter A. Cholak, Damir D. Dzhafarov
Some results concerning the SRT22 vs. COH problem. Comput. 9(3-4): 193-217 (2020)
2010 – 2019
- 2019
- [j13]Benoit Monin, Ludovic Patey
Π1-Encodability and Omniscient Reductions. Notre Dame J. Formal Log. 60(1): 1-12 (2019) - 2018
- [j12]Ludovic Patey
Partial orders and immunity in reverse mathematics. Comput. 7(4): 323-339 (2018) - 2017
- [j11]Ludovic Patey
The reverse mathematics of non-decreasing subsequences. Arch. Math. Log. 56(5-6): 491-506 (2017) - [j10]Ludovic Patey
Dominating the Erdős-Moser theorem in reverse mathematics. Ann. Pure Appl. Log. 168(6): 1172-1209 (2017) - [j9]Ludovic Patey
Controlling iterated jumps of solutions to combinatorial problems. Comput. 6(1): 47-78 (2017) - [j8]Ludovic Patey
Iterative forcing and hyperimmunity in reverse mathematics. Comput. 6(3): 209-221 (2017) - [j7]Emanuele Frittaion
Coloring the rationals in reverse mathematics. Comput. 6(4): 319-331 (2017) - [j6]Laurent Bienvenu, Ludovic Patey
Diagonally non-computable functions and fireworks. Inf. Comput. 253: 64-77 (2017) - 2016
- [j5]Ludovic Patey
Open Questions about Ramsey-Type Statements in Reverse Mathematics. Bull. Symb. Log. 22(2): 151-169 (2016) - [j4]Ludovic Patey
The strength of the Tree Theorem for Pairs in Reverse Mathematics. J. Symb. Log. 81(4): 1481-1499 (2016) - [c4]Ludovic Patey
Partial Orders and Immunity in Reverse Mathematics. CiE 2016: 353-363 - 2015
- [j3]Ludovic Patey
Ramsey-type graph coloring and diagonal non-computability. Arch. Math. Log. 54(7-8): 899-914 (2015) - [j2]Ludovic Patey
Degrees bounding principles and universal instances in reverse mathematics. Ann. Pure Appl. Log. 166(11): 1165-1185 (2015) - [j1]Ludovic Patey:
The complexity of satisfaction problems in reverse mathematics. Comput. 4(1): 69-84 (2015) - [c3]Ludovic Patey
Iterative Forcing and Hyperimmunity in Reverse Mathematics. CiE 2015: 291-301 - 2014
- [c2]Ludovic Patey
The Complexity of Satisfaction Problems in Reverse Mathematics. CiE 2014: 333-342
2000 – 2009
- 2009
- [c1]Gilles Bisson, Ludovic Patey
Les " arbres empilés ": une nouvelle approche pour la visualisation des grands dendrogrammes. IHM 2009: 43-49
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: