A survey on universal computably enumerable equivalence relations
From MaRDI portal
Publication:2970971
DOI10.1007/978-3-319-50062-1_25zbMATH Open1485.03146OpenAlexW2558071339MaRDI QIDQ2970971FDOQ2970971
Authors: Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi 
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_25
Recommendations
Cites Work
- Title not available (Why is that?)
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- Isomorphism relations on computable structures
- A Note on Positive Equivalence Relations
- Graphs realised by r.e. equivalence relations
- Theory of Formal Systems. (AM-47)
- Theorie der Numerierungen I
- Positive equivalences
- Classifying positive equivalence relations
- Computably enumerable equivalence relations
- Creative sets
- On the relation provable equivalence and on partitions in effectively inseparable sets
- On weakly pre-complete positive equivalences
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
- The hierarchy of equivalence relations on the natural numbers under computable reducibility
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Relatively precomplete numerations and arithmetic
- Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
- THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- Computability theory
- Weakly precomplete computably enumerable equivalence relations
- Universal computably enumerable equivalence relations
- Equivalence relations that are \(\Sigma^0_3\) complete for computable reducibility (extended abstract)
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- Creative Functions
Cited In (28)
- Well-orders realized by C.E. equivalence relations
- On computable numberings of families of Turing degrees
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
- Elementary theories and hereditary undecidability for semilattices of numberings
- Primitive recursive equivalence relations and their primitive recursive complexity
- Subrecursive equivalence relations and (non-)closure under lattice operations
- Boolean algebras realized by c.e. equivalence relations
- Computable embeddability for algebraic structures
- Special classes of positive preorders
- A note on joins and meets for positive linear preorders
- Weakly precomplete equivalence relations in the Ershov hierarchy
- On dark computably enumerable equivalence relations
- Numberings, c.e. oracles, and fixed points
- Partial combinatory algebra and generalized numberings
- Fixed point theorems for precomplete numberings
- Computable reducibility for computable linear orders of type \(\omega \)
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Index sets for classes of positive preorders
- Fixpoints and relative precompleteness
- Universal computably enumerable equivalence relations
- Classifying word problems of finitely generated algebras via computable reducibility
- On universal positive graphs
- Word problems and ceers
- Classifying equivalence relations in the Ershov hierarchy
- INITIAL SEGMENTS OF THE DEGREES OF CEERS
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies
- The structure of computably enumerable preorder relations
- The category of equivalence relations
This page was built for publication: A survey on universal computably enumerable equivalence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970971)
