Patrizio Cintioli

Mathematics Division
School of Science and Technology
University of Camerino, Italy

Research Interests

• Computability Theory

• Ordered Sets

Open Problems Addressed with AI

• A Computably Enumerable tt-Degree Without Computably Enumerable Irreducible m-Degrees

• A Computably Enumerable Many-One Degree With No Least Finite-One Degree

• Every nonrecursive many-one degree contains either one or infinitely many finite-one degrees

• A bounded finite-one degree whose one-one degrees form exactly a dense linear order

• Every introenumerable set contains a uniformly introreducible subset

• Cone avoidance and the no-least-join theorem

• Reconstruction of finite posets of width three

• Component reductions and the connected relatiomal fixed point property (arXiv submission forthcoming)

• Pseudo-hyperjump inversion fails for Turing degrees

• A special $\Pi^0_1 class with the join property but without pseudojump inversion

• Rankwise automorphism extension in finite posets (arXiv submission forthcoming)

• RCAo proves the collapse of the intersection principles hierarchy al level two (arXiv submission forthcoming)

• 1-Genericity is not Weihrauch reducible to the finite intersection principle (arXiv submission forthcoming)

Other Research Results Obtained with AI

• Dense Chains, Antichains, And Universal Partial Orders Inside A Bounded Finite-One Degree

• m-Rigidity, Finite-One, and Bounded Finite-One Degrees Inside Typical Many-One Degrees

• A strengthened form of Dëgtev argument and D-maximal many-one degrees

Contact

patrizio.cintioli@gmail.it