Remarks on Uniformly Finitely Precomplete Positive Equivalences

DOI10.1002/malq.19960420107zbMath0852.03021OpenAlexW1987946099MaRDI QIDQ4868242

V. Yu. Shavrukov

Publication date: 5 December 1996

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19960420107

zbMATH Keywords

precomplete numerationfixed points of endomorphisms\(e\)-complete numerationr.e. equivalence relations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Word problems and ceers ⋮ Jumps of computably enumerable equivalence relations ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Fixed points and unfounded chains ⋮ Weakly precomplete computably enumerable equivalence relations ⋮ Precomplete numberings ⋮ The category of equivalence relations ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS ⋮ Effective inseparability and its applications

Cites Work

• Relatively precomplete numerations and arithmetic
• Theorie der Numerierungen I
• Unnamed Item
• Unnamed Item