Marta Fiori-Carones, Variations of statement, variations of strength.
The case of the Rival and Sands theorems (submitted)
Marta Fiori-Carones, Leszek Aleksander Kołodziejczyk, Tin Lok Wong, Keita Yokoyama, An isomorphism theorem for models of Weak König's Lemma without primitive recursion, Journal of the European Mathematical Society (accepted)
Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander Melnikov, Primitive recursive reverse mathematics (submitted)
Marta Fiori-Carones, Alberto Marcone, Paul Shafer, Giovanni Soldà, (Extra)ordinary equivalences with the ascending descending sequence principle, Journal of Symbolic Logic (accepted)
Marta Fiori-Carones, Alberto Marcone, Uniquely orderable interval graphs , Discrete Mathematics 345 (2022), 112935
Marta Fiori-Carones, Paul Shafer, Giovanni Soldà, An inside-outside Ramsey theorem and computability theory , Transactions of the American Mathematical Society 375 (2022), pp. 1977-2024
Marta Fiori-Carones, Leszek Aleksander Kołodziejczyk, Katarzyna W. Kowalik, Weaker cousins of Ramsey's theorem over a weak base theory, Annals of Pure and Applied Logic 172 (2021), pp. 103028
Marta Fiori-Carones, Alberto Marcone, To reorient is easier than to orient: an on-line algorithm to reorient pseudo-transitive graphs, Computability 10 (2021), pp. 215-233
Invited talks
07.2023
Where does intensionality lie in computability?
Panel 'New Directions in Philosophy of Computability', 17th International Congress on
Logic, Methodology and Philosophy of Science and Technology, Buenos Aires
05.2023
The strength of the existence of positive, Friedberg and minimal numberings
Computability and Combinatorics 2023, University of Connecticut, hybrid
02.2023
Different base theories for reverse mathematics
Mathematical Indispensability in Philosophy workshop, Munich Center for Mathematical Philosophy, hybrid
10.2022
Primitive recursive reverse mathematics
Workshop on Digitalization and Computable Models, online
06.2022
A theorem of Rival and Sands in the Weihrauch lattice
Computing in topological structures, Sirius mathematical Center, Sochi
06.2022
The strength of some consequences of \(\mathsf{RT}_2^2\) over \(\mathsf{RCA}_0^*\)
Steklov Institute of Mathematics, Moscow
06.2022
When is unbounded search necessary?
Leeds Computability Days, online
04.2022
The strength of a family of Ramsey's like statements
Seminar on computability theory, Kazan Federal university
10.2021
Different behaviour of \(\mathsf{CRT}_2^2\) and \(\mathsf{COH}\) over \(\mathsf{RCA}^*_0\)
Università di Udine
09.2021
The epistemological reading of reverse mathematics through an example
Workshop in Philosophy of Computing, Politechnika Warszawska, online
07.2021
An algorithm for reorienting infinite pseudo-transitive graphs
Computability and Complexity in Analysis, Universität der Bundeswehr München, online
05.2021
A characterisation theorem for uniquely orderable interval graphs
filoLOGICA, Università degli Studi di Bologna, online
02.2021
The strength of \(\mathsf{ADS}\) and \(\mathsf{CAC}\) in the absence of \(\,\Sigma^0_1\)-induction
South Eastern Logic Symposium 2021, online
05.2020
A theorem from Rival and Sands and reverse mathematics
Online seminar on Computability Theory and Applications
03.2020
(Extra)ordinary equivalences with \(\mathsf{ADS}\)
ASL North American Meeting, special session on Reverse mathematics and computability theory of Ramsey-theoretic principles (cancelled)