- On diagonal functions for equivalence relations.Serikzhan A. Badaev, Nikolay A. Bazhenov, Birzhan S. Kalmurzayev & Manat Mustafa - 2023 - Archive for Mathematical Logic 63 (3):259-278.details
|
|
The theory of ceers computes true arithmetic.Uri Andrews, Noah Schweber & Andrea Sorbi - 2020 - Annals of Pure and Applied Logic 171 (8):102811.details
|
|
Classifying equivalence relations in the Ershov hierarchy.Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi & Mars Yamaleev - 2020 - Archive for Mathematical Logic 59 (7-8):835-864.details
|
|
Thin Objects Are Not Transparent.Matteo Plebani, Luca San Mauro & Giorgio Venturi - 2023 - Theoria 89 (3):314-325.details
|
|
Word problems and ceers.Valentino Delle Rose, Luca San Mauro & Andrea Sorbi - 2020 - Mathematical Logic Quarterly 66 (3):341-354.details
|
|
Graphs realised by r.e. equivalence relations.Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov & Frank Stephan - 2014 - Annals of Pure and Applied Logic 165 (7-8):1263-1290.details
|
|
Σ 1 0 and Π 1 0 equivalence structures.Douglas Cenzer, Valentina Harizanov & Jeffrey B. Remmel - 2011 - Annals of Pure and Applied Logic 162 (7):490-503.details
|
|
Computable Reducibility of Equivalence Relations and an Effective Jump Operator.John D. Clemens, Samuel Coskey & Gianni Krakoff - forthcoming - Journal of Symbolic Logic:1-22.details
|
|
On the Structure of Computable Reducibility on Equivalence Relations of Natural Numbers.Uri Andrews, Daniel F. Belin & Luca San Mauro - 2023 - Journal of Symbolic Logic 88 (3):1038-1063.details
|
|
Initial Segments of the Degrees of Ceers.Uri Andrews & Andrea Sorbi - 2022 - Journal of Symbolic Logic 87 (3):1260-1282.details
|
|
Agreement reducibility.Rachel Epstein & Karen Lange - 2020 - Mathematical Logic Quarterly 66 (4):448-465.details
|
|
The noneffectivity of Arslanov’s completeness criterion and related theorems.Sebastiaan A. Terwijn - 2020 - Archive for Mathematical Logic 59 (5-6):703-713.details
|
|
Fixed point theorems for precomplete numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.details
|
|
Fixed points and unfounded chains.Claudio Bernardi - 2001 - Annals of Pure and Applied Logic 109 (3):163-178.details
|
|
? 0 N -equivalence relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.details
|
|
Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.details
|
|
On the Degree Structure of Equivalence Relations Under Computable Reducibility.Keng Meng Ng & Hongyuan Yu - 2019 - Notre Dame Journal of Formal Logic 60 (4):733-761.details
|
|
Computably enumerable equivalence relations.Su Gao & Peter Gerdes - 2001 - Studia Logica 67 (1):27-59.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):60-88.details
|
|
On Σ1 1 equivalence relations over the natural numbers.Ekaterina B. Fokina & Sy-David Friedman - 2012 - Mathematical Logic Quarterly 58 (1-2):113-124.details
|
|
Weakly precomplete computably enumerable equivalence relations.Serikzhan Badaev & Andrea Sorbi - 2016 - Mathematical Logic Quarterly 62 (1-2):111-127.details
|
|
Jumps of computably enumerable equivalence relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.details
|
|