The following pages link to Andrea Sorbi (Q242615):
Displayed 50 items.
- Properly enumeration degrees and the high/low hierarchy (Q3416107) (← links)
- Some Quotient Lattices of the Medvedev Lattice (Q3480025) (← links)
- (Q3480026) (← links)
- Some remarks on the algebraic structure of the Medvedev Lattice (Q3481688) (← links)
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy (Q3546062) (← links)
- The First Order Theories of the Medvedev and Muchnik Lattices (Q3576064) (← links)
- Strong Positive Reducibilities (Q3630187) (← links)
- High Minimal Pairs in the Enumeration Degrees (Q3630219) (← links)
- Universal recursion theoretic properties of r.e. preordered structures (Q3699683) (← links)
- On Quasi-Minimal e-Degrees and Total e-Degrees (Q3795667) (← links)
- (Q3967526) (← links)
- REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS (Q4295215) (← links)
- A Note on Relative Efficiency of Axiom Systems (Q4304111) (← links)
- (Q4348132) (← links)
- (Q4460829) (← links)
- (Q4513980) (← links)
- Embedding finite lattices into the Σ<sub>2</sub><sup>0</sup> enumeration degrees (Q4532601) (← links)
- (Q4559854) (← links)
- S. Barry Cooper (1943–2015) (Q4683146) (← links)
- (Q4745816) (← links)
- (Q4863250) (← links)
- A Note on Closed Degrees of Difficulty of the Medvedev Lattice (Q4868246) (← links)
- Immunity properties of the s-degrees (Q4933473) (← links)
- (Q4944900) (← links)
- (Q4946105) (← links)
- The distribution of properly Σ<sub>2</sub><sup>0</sup> e-degrees (Q4953207) (← links)
- Structural properties and Σ<sub>2</sub><sup>0</sup> enumeration degrees (Q4953220) (← links)
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS (Q5027663) (← links)
- Primitive recursive equivalence relations and their primitive recursive complexity (Q5061388) (← links)
- INITIAL SEGMENTS OF THE DEGREES OF CEERS (Q5100062) (← links)
- Self-full ceers and the uniform join operator (Q5158363) (← links)
- Computing with Incomplete Information (Q5218477) (← links)
- Comparing $∏^0_2$ sets of the Baire space by means of general recursive operators (Q5289033) (← links)
- Learning Theory and Kernel Machines (Q5305888) (← links)
- IN MEMORIAM: BARRY COOPER 1943–2015 (Q5346708) (← links)
- Singleton enumeration reducibility and arithmetic (Q5406117) (← links)
- Bounding nonsplitting enumeration degrees (Q5444709) (← links)
- A characterization of the δ<sub>2</sub><sup>0</sup> hyperhyperimmune sets (Q5502826) (← links)
- Bounding and nonbounding minimal pairs in the enumeration degrees (Q5718686) (← links)
- TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS (Q5737944) (← links)
- TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS (Q5741615) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets (Q5961497) (← links)
- Word problems and ceers (Q6096328) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities (Q6166690) (← links)
- Calibrating word problems of groups via the complexity of equivalence relations (Q6277425) (← links)
- Effective inseparability, lattices, and pre-ordering relations (Q6312663) (← links)
- A note on the category of equivalence relations (Q6368092) (← links)
- Punctual equivalence relations and their (punctual) complexity (Q6377198) (← links)