 Remarks on Uniformly Finitely Precomplete Positive Equivalences.V. Yu Shavrukov  1996  Mathematical Logic Quarterly 42 (1):6782.details


? 0 N equivalence relations.Andrea Sorbi  1982  Studia Logica 41 (4):351358.details


Erratum to “The Ricean Objection: An Analogue of Rice's Theorem for FirstOrder Theories” Logic Journal of the IGPL, 16: 585–590. [REVIEW]Igor Oliveira & Walter Carnielli  2009  Logic Journal of the IGPL 17 (6):803804.details


Universal recursion theoretic properties of R.e. Preordered structures.Franco Montagna & Andrea Sorbi  1985  Journal of Symbolic Logic 50 (2):397406.details


Relatively precomplete numerations and arithmetic.Franco Montagna  1982  Journal of Philosophical Logic 11 (4):419  430.details


Graphs realised by r.e. equivalence relations.Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan  2014  Annals of Pure and Applied Logic 165 (78):12631290.details


Maximal R.e. Equivalence relations.Jeffrey S. Carroll  1990  Journal of Symbolic Logic 55 (3):10481058.details


Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi  1983  Journal of Symbolic Logic 48 (3):529538.details


On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella  1989  Mathematical Logic Quarterly 35 (3):261268.details


On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella  1989  Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):261268.details


Weakly precomplete computably enumerable equivalence relations.Serikzhan Badaev & Andrea Sorbi  2016  Mathematical Logic Quarterly 62 (12):111127.details


Universal computably enumerable equivalence relations.Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro & Andrea Sorbi  2014  Journal of Symbolic Logic 79 (1):6088.details


Jumps of computably enumerable equivalence relations.Uri Andrews & Andrea Sorbi  2018  Annals of Pure and Applied Logic 169 (3):243259.details

