The following pages link to Andrea Sorbi (Q242615):
Displayed 50 items.
- A note on the enumeration degrees of 1-generic sets (Q283105) (← links)
- Intuitionistic logic and Muchnik degrees (Q412013) (← links)
- Topological aspects of the Medvedev lattice (Q535142) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- A note on algebras of languages (Q650885) (← links)
- Bounded enumeration reducibility and its degree structure (Q661285) (← links)
- (Q695802) (redirect page) (← links)
- Positive undecidable numberings in the Ershov hierarchy (Q695803) (← links)
- Computation and logic in the real world: CiE 2007 (Q733735) (← links)
- Empty intervals in the enumeration degrees (Q764276) (← links)
- \(\Sigma^ n_ 0\)-equivalence relations (Q793716) (← links)
- Strong enumeration reducibilities (Q850805) (← links)
- Taking the Pirahã seriously (Q907196) (← links)
- On some filters and ideals of the Medvedev lattice (Q916651) (← links)
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective (Q938234) (← links)
- Intermediate logics and factors of the Medvedev lattice (Q952483) (← links)
- Undecidability of local structures of s-degrees and Q-degrees (Q1009444) (← links)
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← links)
- Sets of generator and automorphism bases for the enumeration degrees (Q1295393) (← links)
- Density results in the \(\Delta_2^0\) e-degrees (Q1407513) (← links)
- Quasi-minimal enumeration degrees and minimal Turing degrees (Q1568759) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- Embedding Brouwer algebra in the Medvedev lattice (Q1812988) (← links)
- Logic and probabilistic systems (Q1915126) (← links)
- Effective inseparability and its applications (Q2117804) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees (Q2204365) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- A note on uniform density in weak arithmetical theories (Q2219096) (← links)
- Comparing the degrees of enumerability and the closed Medvedev degrees (Q2312080) (← links)
- Generalizations of the weak law of the excluded middle (Q2354624) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms (Q2568460) (← links)
- (Q2709299) (← links)
- Weakly precomplete computably enumerable equivalence relations (Q2793914) (← links)
- INITIAL SEGMENTS OF THE ENUMERATION DEGREES (Q2805039) (← links)
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy (Q2910992) (← links)
- A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES (Q2921013) (← links)
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2921020) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2976337) (← links)
- Diamond embeddings into the enumeration degrees (Q3060191) (← links)
- (Q3068278) (← links)
- Trial and error mathematics: Dialectical systems and completions of theories (Q3120211) (← links)
- Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477) (← links)
- Creativeness and completeness in recursion categories of partial recursive operators (Q3199409) (← links)
- Classifying positive equivalence relations (Q3309827) (← links)
- ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS (Q3379460) (← links)
- Notes on conjunctive and Quasi degrees (Q3382823) (← links)
- Elementary Theories for Rogers Semilattices (Q3409439) (← links)