Benoit Monin

Available identifiers

zbMath Open monin.benoitMaRDI QIDQ1747491

List of research outcomes

Publication	Date of Publication	Type
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective	2024-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5039753	2022-10-04	Paper
Partition genericity and pigeonhole basis theorems	2022-04-06	Paper
The weakness of the pigeonhole principle under hyperarithmetical reductions	2021-11-03	Paper
Muchnik degrees and cardinal characteristics	2021-10-27	Paper
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models	2021-08-23	Paper
Bad oracles in higher computability and randomness	2021-04-29	Paper
An answer to the gamma question	2021-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q5111248	2020-05-26	Paper
Genericity and randomness with ITTMs	2020-01-10	Paper
Pigeons do not jump high	2019-07-19	Paper
\({\Pi}_1^0\)-encodability and omniscient reductions	2019-05-29	Paper
SRT22 does not imply RT22 in omega-models	2019-05-20	Paper
A computable analysis of variable words theorems	2019-01-07	Paper
Two more characterizations of \(K\)-triviality	2018-05-18	Paper
Algorithmic identification of probabilities is hard	2018-05-08	Paper
A unifying approach to the Gamma question	2018-04-23	Paper
Higher randomness and genericity	2017-12-19	Paper
Higher randomness and forcing with closed sets	2017-07-17	Paper
Continuous higher randomness	2017-06-20	Paper
Von Neumann's biased coin revisited	2017-05-16	Paper
Higher randomness and forcing with closed sets	2017-03-03	Paper
Pi01 encodability and omniscient reductions	2016-03-03	Paper
Algorithmic identification of probabilities is hard	2015-01-14	Paper

Research outcomes over time

This page was built for person: Benoit Monin