The completeness of the isomorphism relation for countable Boolean algebras
From MaRDI portal
Publication:4517450
DOI10.1090/S0002-9947-00-02659-3zbMath0960.03041OpenAlexW1699173769MaRDI QIDQ4517450
Publication date: 22 November 2000
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-00-02659-3
Polish group actionsBorel reducibilityVaught's conjecturedefinable equivalence relationsseparable Boolean spaces
Related Items (27)
Degree spectra and computable dimensions in algebraic structures ⋮ The homeomorphism problem for countable topological spaces ⋮ 2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Complete analytic equivalence relations ⋮ Dynamical simplices and Borel complexity of orbit equivalence ⋮ THE CLASSIFICATION PROBLEM FOR AUTOMORPHISMS OF C*-ALGEBRAS ⋮ Analytic sets of reals and the density function in the Cantor space ⋮ CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES ⋮ Classes of algebraic structures ⋮ The conjugacy problem for the automorphism group of the random graph ⋮ Large-scale geometry of big mapping class groups ⋮ Learning algebraic structures with the help of Borel equivalence relations ⋮ Uncountable structures are not classifiable up to bi-embeddability ⋮ Measuring the classification difficulty of countable torsion-free Abelian groups. ⋮ THE COMPLEXITY OF HOMEOMORPHISM RELATIONS ON SOME CLASSES OF COMPACTA ⋮ The Prospects for Mathematical Logic in the Twenty-First Century ⋮ Unitary equivalence of automorphisms of separable \(C^*\)-algebras ⋮ On the isomorphism problem for measures on Boolean algebras ⋮ Downward closure of depth in countable Boolean algebras ⋮ Depth zero Boolean algebras ⋮ Ranked structures and arithmetic transfinite recursion ⋮ The class of non-Desarguesian projective planes is Borel complete ⋮ Classification problems in continuum theory ⋮ THE QUANDARY OF QUANDLES: A BOREL COMPLETE KNOT INVARIANT ⋮ The complexity of the classification problems of finite-dimensional continua ⋮ Borel complexity and automorphisms of \(C^*\)-algebras ⋮ The relation of recursive isomorphism for countable structures
Cites Work
- The structure of countable Boolean algebras
- Minimally generated Boolean algebras
- A Borel reductibility theory for classes of countable structures
- The Algebraic Simplicity of Certain Groups of Homeomorphisms
- Representing real numbers in denumerable Boolean algebras
- The number of countable isomorphism types of complete extensions of the theory of Boolean algebras
- Analytic equivalence relations and Ulm-type classifications
- Inductive Limits of Finite Dimensional C ∗ -Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The completeness of the isomorphism relation for countable Boolean algebras