Patrizio Cintioli

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Degrees of sets having no subsets of higher m- and t t-degree Computability	2021-11-18	Paper
Corrigendum to “Sets with no subsets of higher weak truth-table degree”, Reports on Mathematical Logic, 53 (2018), 3–17 Reports on Mathematical Logic	2020-09-22	Paper
Sets with no subsets of higher weak truth-table degree Reports on Mathematical Logic	2019-03-11	Paper
Revisiting a result of Ko Information Processing Letters	2016-05-26	Paper
Low sets without subsets of higher many-one degree Mathematical Logic Quarterly	2011-11-07	Paper
Sets without subsets of higher many-one degree Notre Dame Journal of Formal Logic	2005-09-28	Paper
Polynomial time introreducibility Theory of Computing Systems	2003-08-26	Paper
The Helping Hierarchy RAIRO - Theoretical Informatics and Applications	2001-01-01	Paper
The Helping Hierarchy RAIRO - Theoretical Informatics and Applications	2001-01-01	Paper
Helping by unambiguous computation and probabilistic computation Theory of Computing Systems	1997-11-18	Paper
\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation Notre Dame Journal of Formal Logic	1995-09-28	Paper

Research outcomes over time

This page was built for person: Patrizio Cintioli