Classifying positive equivalence relations
From MaRDI portal
Publication:3309827
DOI10.2307/2273443zbMath0528.03030MaRDI 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
03F30: First-order arithmetic and fragments
03D25: Recursively (computably) enumerable sets and degrees
03D45: Theory of numerations, effectively presented structures
Related Items
GENERALIZATIONS OF THE RECURSION THEOREM, Theoretical Pearls:Representing ‘undefined’ in lambda calculus, Primitive recursive equivalence relations and their primitive recursive complexity, Fixpoints and relative precompleteness, INITIAL SEGMENTS OF THE DEGREES OF CEERS, Fixed points and unfounded chains, Computable embeddability for algebraic structures, 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, Computable reducibility for computable linear orders of type \(\omega \), \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures, The noneffectivity of Arslanov's completeness criterion and related theorems, \(\Sigma^ n_ 0\)-equivalence relations, Reducibilities among equivalence relations induced by recursively enumerable structures, Hyperdiagonalizable algebras, On a conjecture of Bergstra and Tucker, On dark computably enumerable equivalence relations, Jumps of computably enumerable equivalence relations, Precomplete numberings, The category of equivalence relations, Completeness of the hyperarithmetic isomorphism equivalence relation, Special classes of positive preorders, Partial combinatory algebra and generalized numberings, Index sets for classes of positive preorders, The theory of ceers computes true arithmetic, Classifying equivalence relations in the Ershov hierarchy, Minimal equivalence relations in hyperarithmetical and analytical hierarchies, The structure of computably enumerable preorder relations, On computably enumerable structures, On the degree structure of equivalence relations under computable reducibility, Weakly precomplete equivalence relations in the Ershov hierarchy, Fixed point theorems for precomplete numberings, Graphs realised by r.e. equivalence relations, On universal positive graphs, Weakly precomplete computably enumerable equivalence relations, A Survey on Universal Computably Enumerable Equivalence Relations, On Σ1 1 equivalence relations over the natural numbers, Precomplete Equivalence Relations in Dominical Categories
Cites Work
