The following pages link to Patrizio Cintioli (Q286989):
Displayed 20 items.
- Revisiting a result of Ko (Q286990) (← links)
- The degrees of bi-hyperhyperimmune sets (Q386147) (← links)
- (Q675864) (redirect page) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Polynomial time introreducibility (Q1405796) (← links)
- Generic amplification of recursively enumerable sets (Q1731522) (← links)
- \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation (Q1893143) (← links)
- The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent (Q1944337) (← links)
- Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability (Q1946791) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Where join preservation fails in the bounded Turing degrees of c.e. sets (Q2407100) (← links)
- A bounded jump for the bounded Turing degrees (Q2452680) (← links)
- Sets without subsets of higher many-one degree (Q2565991) (← links)
- Low sets without subsets of higher many-one degree (Q3096087) (← links)
- The Helping Hierarchy (Q4331052) (← links)
- Sets with no subsets of higher weak truth-table degree (Q4627721) (← links)
- Corrigendum to “Sets with no subsets of higher weak truth-table degree”, Reports on Mathematical Logic, 53 (2018), 3–17 (Q5121963) (← links)
- Degrees of sets having no subsets of higher m- and t t-degree (Q5859845) (← links)