Pages that link to "Item:Q636325"
From MaRDI portal
The following pages link to The effective theory of Borel equivalence relations (Q636325):
Displaying 17 items.
- Implicit definability in arithmetic (Q306821) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- The theory of ceers computes true arithmetic (Q2187270) (← links)
- On computably enumerable structures (Q2263114) (← links)
- On \(\Delta_2^0\)-categoricity of equivalence relations (Q2346952) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- The Borel complexity of von Neumann equivalence (Q2660161) (← links)
- UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q2921020) (← links)
- FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS (Q2976331) (← links)
- 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 (Q3011106) (← links)
- On Σ<sup>1</sup> <sub>1</sub> equivalence relations over the natural numbers (Q3117786) (← links)
- A dichotomy for the definable universe (Q4876320) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- Isomorphism relations on computable structures (Q5388722) (← links)
- Turing computable embeddings of equivalences other than isomorphism (Q5401521) (← links)
- Wadge hardness in Scott spaces and its effectivization (Q5740667) (← links)
- Agreement reducibility (Q6047663) (← links)
