The effective Borel hierarchy

DOI10.4064/fm195-3-4zbMath1125.03035OpenAlexW2042181181MaRDI QIDQ5310190

No author found.

Publication date: 20 September 2007

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm195-3-4

zbMATH Keywords

computable embeddingVaught's theoremeffective Borel set

Mathematics Subject Classification ID

Descriptive set theory (03E15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (13)

2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ An example related to Gregory's theorem ⋮ Scott ranks of models of a theory ⋮ The first-order syntax of variadic functions ⋮ Index sets and Scott sentences ⋮ Classes of algebraic structures ⋮ Describing groups ⋮ Complexity of Scott sentences ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Analytic equivalence relations and bi-embeddability ⋮ Scott sentences for equivalence structures ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

This page was built for publication: The effective Borel hierarchy