Marta Fiori-Carones

Follow

Generating author description...

All published works
Action Title Year Authors
+ An isomorphism theorem for models of weak König’s lemma without primitive recursion 2024 Marta Fiori-Carones
Leszek Aleksander Kołodziejczyk
Tin Lok Wong
Keita Yokoyama
+ On Arithmetical Numberings in Reverse Mathematics 2024 Nikolay Bazhenov
Marta Fiori-Carones
Manat Mustafa
+ Variations of Statement, Variations of Strength. The Case of the Rival–Sands Theorems 2023 Marta Fiori-Carones
+ PDF Chat Primitive recursive reverse mathematics 2023 Nikolay Bazhenov
Marta Fiori-Carones
Lu Liu
Alexander Melnikov
+ PDF Chat (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE 2022 Marta Fiori-Carones
Alberto Marcone
Paul Shafer
Giovanni Soldà
+ PDF Chat Uniquely orderable interval graphs 2022 Marta Fiori-Carones
Alberto Marcone
+ Primitive recursive reverse mathematics 2022 Nikolay Bazhenov
Marta Fiori-Carones
Lu Liu
Alexander Melnikov
+ An inside/outside Ramsey theorem and recursion theory 2021 Marta Fiori-Carones
Paul Shafer
Giovanni Soldà
+ PDF Chat Weaker cousins of Ramsey's theorem over a weak base theory 2021 Marta Fiori-Carones
Leszek Aleksander Kołodziejczyk
Katarzyna W. Kowalik
+ Weaker cousins of Ramsey's theorem over a weak base theory 2021 Marta Fiori-Carones
Leszek Aleksander Kołodziejczyk
Katarzyna W. Kowalik
+ PDF Chat To reorient is easier than to orient: An on-line algorithm for reorientation of graphs 2021 Marta Fiori-Carones
Alberto Marcone
+ An isomorphism theorem for models of Weak König's Lemma without primitive recursion 2021 Marta Fiori-Carones
Leszek Aleksander Kołodziejczyk
Tin Lok Wong
Keita Yokoyama
+ (Extra)ordinary equivalences with the ascending/descending sequence principle 2021 Marta Fiori-Carones
Alberto Marcone
Paul Shafer
Giovanni Soldà
+ Weaker cousins of Ramsey's theorem over a weak base theory 2021 Marta Fiori-Carones
Leszek Aleksander Kołodziejczyk
Katarzyna W. Kowalik
+ Uniquely orderable interval graphs 2021 Marta Fiori-Carones
Alberto Marcone
+ An inside/outside Ramsey theorem and recursion theory 2020 Marta Fiori-Carones
Paul Shafer
Giovanni Soldà
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat On the strength of Ramsey's theorem for pairs 2001 Peter Cholak
Carl G. Jockusch
Theodore A. Slaman
6
+ PDF Chat Weihrauch Complexity in Computable Analysis 2021 Vasco Brattka
Guido Gherardi
Arno Pauly
5
+ Combinatorial principles weaker than Ramsey's Theorem for pairs 2007 Denis R. Hirschfeldt
Richard A. Shore
5
+ Reverse mathematics and Peano categoricity 2012 Stephen G. Simpson
Keita Yokoyama
5
+ The uniform content of partial and linear orders 2016 Eric P. Astor
Damir D. Dzhafarov
Reed Solomon
Jacob Suggs
4
+ PDF Chat SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS 2013 Manuel Lerman
Reed Solomon
Henry Towsner
4
+ PDF Chat HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? 2022 Leszek Aleksander Kołodziejczyk
Katarzyna W. Kowalik
Keita Yokoyama
4
+ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>Π</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math>-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs 2012 C. T. Chong
Theodore A. Slaman
Yue Yang
4
+ An inside/outside Ramsey theorem and recursion theory 2021 Marta Fiori-Carones
Paul Shafer
Giovanni Soldà
4
+ PDF Chat The proof-theoretic strength of Ramsey's theorem for pairs and two colors 2018 Ludovic Patey
Keita Yokoyama
4
+ Categorical characterizations of the natural numbers require primitive recursion 2014 Leszek Aleksander Kołodziejczyk
Keita Yokoyama
4
+ PDF Chat RT<sub>2</sub><sup>2</sup> does not imply WKL<sub>0</sub> 2012 Jiayi Liu
3
+ On the strength of Ramsey's theorem without Σ<sub>1</sub>‐induction 2013 Keita Yokoyama
3
+ Partition Theorems and Computability Theory 2005 Joseph R. Mileti
3
+ PDF Chat Weihrauch degrees, omniscience principles and weak computability 2011 Vasco Brattka
Guido Gherardi
3
+ Ramsey's theorem and recursion theory 1972 Carl G. Jockusch
3
+ PDF Chat ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM 2017 Vasco Brattka
Tahina Rakotoniaina
3
+ The jump of a Σ<sub> <i>n</i> </sub> -cut 2007 C. T. Chong
Yue Yang
3
+ Ramsey's Theorem does not Hold in Recursive Set Theory 1971 Bonny Specker
2
+ PDF Chat Reverse mathematics, well-quasi-orders, and Noetherian spaces 2016 Emanuele Frittaion
Matthew Hendtlass
Alberto Marcone
Paul Shafer
Jeroen Van der Meeren
2
+ Subsystems of Second Order Arithmetic 1999 Stephen G. Simpson
2
+ Models of Peano Arithmetic 1991 Richard Kaye
2
+ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics 2009 C.P. Chong
Steffen Lempp
Yue Yang
2
+ PDF Chat How Incomputable Is the Separable Hahn-Banach Theorem? 2009 Guido Gherardi
Alberto Marcone
2
+ Corrigendum to: “On the strength of Ramsey's Theorem for pairs” 2009 Peter Cholak
Carl G. Jockusch
Theodore A. Slaman
2
+ Abelian groups without elements of finite order 1937 Reinhold Baer
2
+ PDF Chat Fixed point theory in weak second-order arithmetic 1990 Naoki Shioji
Kazuyuki Tanaka
2
+ Infinite dimensional proper subspaces of computable vector spaces 2014 Chris J. Conidis
2
+ PDF Chat On the Strength of Ramsey's Theorem 1995 David Seetapun
Theodore A. Slaman
2
+ PDF Chat The Bolzano–Weierstrass Theorem is the jump of Weak Kőnig’s Lemma 2011 Vasco Brattka
Guido Gherardi
Alberto Marcone
2
+ PDF Chat The atomic model theorem and type omitting 2009 Denis R. Hirschfeldt
Richard A. Shore
Theodore A. Slaman
2
+ Subspaces of computable vector spaces 2007 Rodney G. Downey
Denis R. Hirschfeldt
Asher M. Kach
Steffen Lempp
Joseph R. Mileti
Antonio Montalbán
2
+ PDF Chat An effective version of Dilworth’s theorem 1981 Henry A. Kiersteád
2
+ Existence and feasibility in arithmetic 1971 Rohit Parikh
2
+ Polynomial-time abelian groups 1992 Douglas Cenzer
Jeffrey B. Remmel
2
+ PDF Chat Computable algebra, general theory and theory of computable fields. 1960 Michael O. Rabin
2
+ Recursively presentable prime models 1974 Leo Harrington
2
+ PDF Chat The metamathematics of Stable Ramsey’s Theorem for Pairs 2014 C. T. Chong
Theodore A. Slaman
Yue Yang
2
+ On-Line Coloring and Recursive Graph Theory 1994 H. A. Kierstead
Stephen G. Penrice
W. T. Trotter
2
+ PDF Chat Effective Borel measurability and reducibility of functions 2004 Vasco Brattka
2
+ PDF Chat Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem 2017 Denis R. Hirschfeldt
Karen Lange
Richard A. Shore
2
+ Proper divisibility in computable rings 2016 Noam Greenberg
Alexander Melnikov
2
+ The inductive strength of Ramsey's Theorem for Pairs 2016 C. T. Chong
Theodore A. Slaman
Yue Yang
2
+ PDF Chat Partial orders and immunity in reverse mathematics 2017 Ludovic Patey
2
+ The computability, definability, and proof theory of Artinian rings 2018 Chris J. Conidis
2
+ On uniform relationships between combinatorial problems 2015 François G. Dorais
Damir D. Dzhafarov
Jeffry L. Hirst
Joseph Mileti
Paul Shafer
2
+ PDF Chat REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION 2017 Kostas Hatzikiriakou
Stephen G. Simpson
2
+ Cone avoiding closed sets 2014 Lu Liu
2
+ The back-and-forth method and computability without delay 2019 Alexander Melnikov
Keng Meng Ng
2
+ PDF Chat Constructing sequences one step at a time 2020 Henry Towsner
2