Σ11-Completeness of a Fragment of the Theory of Trees With Subtree Relation. - Patrizio Cintioli; Sauro Tulipani (Notre Dame J. Formal Log., 1994)

Revisiting a Result of Ko. - Patrizio Cintioli; Riccardo Silvestri (Inf. Process. Lett., 1997)

Helping by Unambiguous Computation and Probabilistic Computation. - Patrizio Cintioli; Riccardo Silvestri (Theory Comput. Syst., 1997)

The Helping Hierarchy. - Patrizio Cintioli; Riccardo Silvestri (RAIRO Theor. Informatics Appl., 2001)

Polynomial Time Introreducibility. - Patrizio Cintioli; Riccardo Silvestri (Theory Comput. Syst., 2003)

Sets without Subsets of Higher Many-One Degree. - Patrizio Cintioli (Notre Dame J. Formal Log., 2005)

Low sets without subsets of higher many-one degree. - Patrizio Cintioli (Math. Log. Q., 2011)

Sets with no subsets of higher weak truth-table degree. - Patrizio Cintioli (Reports Math. Log., 2018)

Corrigendum to "Sets with no subsets of higher weak truth-table degree", Reports on Mathematical Logic, 53 (2018). - Patrizio Cintioli (Reports Math. Log., 2020)

Degrees of sets having no subsets of higher m- and tt-degree. - Patrizio Cintioli (Comput., 2021)