Classifying positive equivalence relations
From MaRDI portal
Publication:3309827
DOI10.2307/2273443zbMath0528.03030OpenAlexW2068423429MaRDI QIDQ3309827
Claudio Bernardi, Andrea Sorbi
Publication date: 1983
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273443
First-order arithmetic and fragments (03F30) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items
Hyperdiagonalizable algebras, Completeness of the hyperarithmetic isomorphism equivalence relation, Special classes of positive preorders, On dark computably enumerable equivalence relations, Primitive recursive equivalence relations and their primitive recursive complexity, Partial combinatory algebra and generalized numberings, Fixpoints and relative precompleteness, Index sets for classes of positive preorders, On a conjecture of Bergstra and Tucker, INITIAL SEGMENTS OF THE DEGREES OF CEERS, The theory of ceers computes true arithmetic, Agreement reducibility, ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS, Word problems and ceers, COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR, Reducibilities among equivalence relations induced by recursively enumerable structures, Jumps of computably enumerable equivalence relations, On universal positive graphs, Computable reducibility for computable linear orders of type \(\omega \), Classifying equivalence relations in the Ershov hierarchy, A Survey on Universal Computably Enumerable Equivalence Relations, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures, The structure of computably enumerable preorder relations, GENERALIZATIONS OF THE RECURSION THEOREM, On computably enumerable structures, Fixed points and unfounded chains, Precomplete Equivalence Relations in Dominical Categories, Weakly precomplete computably enumerable equivalence relations, Precomplete numberings, On the degree structure of equivalence relations under computable reducibility, Weakly precomplete equivalence relations in the Ershov hierarchy, Fixed point theorems for precomplete numberings, The category of equivalence relations, The noneffectivity of Arslanov's completeness criterion and related theorems, On Σ1 1 equivalence relations over the natural numbers, \(\Sigma^ n_ 0\)-equivalence relations, Theoretical Pearls:Representing ‘undefined’ in lambda calculus, Graphs realised by r.e. equivalence relations, Computable embeddability for algebraic structures
Cites Work
