On Some Properties of Recursively Enumerable Equivalence Relations

DOI10.1002/MALQ.19890350309MaRDI QIDQ3800019zbMATH OpenOpenAlexFDO

Authors Stefano Baratella

Publication date 1989

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

precomplete equivalence relationsrecursively enumerable equivalence relations

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• \(\Sigma^ n_ 0\)-equivalence relations
• Recursively Enumerable Equivalence Relations Modulo Finite Differences
• Precomplete Equivalence Relations in Dominical Categories
• On weakly pre-complete positive equivalences

Cited in

(11)

• Separation axioms and partitions of the set of natural numbers
• A trichotomy for a class of equivalence relations
• A Note on Positive Equivalence Relations
• On characteristic sets of a system of equivalence relations
• scientific article; zbMATH DE number 4162869 (Why is no real title available?)
• scientific article; zbMATH DE number 3954884 (Why is no real title available?)
• Precomplete Equivalence Relations in Dominical Categories
• Recursively Enumerable Equivalence Relations Modulo Finite Differences
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• On diagonal functions for equivalence relations
• On weakly pre-complete positive equivalences

This page was built for publication: On Some Properties of Recursively Enumerable Equivalence Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800019)