Equivalence relations in set theory, computation theory, model theory and complexity theory

zbMATH Open1358.03067MaRDI QIDQ3464627FDOQ3464627

Authors Sy-David Friedman

Publication date 27 January 2016

zbMATH Keywords

complexity theorymodel theorycomputation theoryBorel reducibilityeffective descriptive set theory

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive set theory (03E15) Set-theoretic model theory (03C55) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The effective theory of Borel equivalence relations
• Borel equivalence relations
• Infinite-time Turing machines and Borel reducibility
• New Directions in Descriptive Set Theory
• Borel equivalence relations. Structure and classification

Cited in

(5)

• MOST(?) THEORIES HAVE BOREL COMPLETE REDUCTS
• Equivalence Relations on Classes of Computable Structures
• Useful mathematical relationships embedded in Tversky's \textit{elimination by aspects} model.
• Universal computably enumerable equivalence relations
• Set theory in predicate calculus with equality

This page was built for publication: Equivalence relations in set theory, computation theory, model theory and complexity theory

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