scientific article
From MaRDI portal
Publication:3464627
zbMATH Open1358.03067MaRDI QIDQ3464627
Publication date: 27 January 2016
Title of this publication is not available (Why is that?)
Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Classification theory, stability, and related concepts in model theory (03C45) Set-theoretic model theory (03C55)
Related Items (4)
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ Useful mathematical relationships embedded in Tversky's \textit{elimination by aspects} model. ⋮ Equivalence Relations on Classes of Computable Structures ⋮ MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3464627)
