The completeness of the isomorphism relation for countable Boolean algebras
By R. Camerlo, Su Gao. 2000
72 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/383bc2cdaf8695e9bcd7af35b09390427930269c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
- Alain Louveau
- Christian Rosendal
- Kasra Rafi
- Kathryn Mann
- Samuel J. Taylor
- U. Hamenstaedt
- Todor Tsankov
- Saul Schleimer
Citations in the corpus
- Large-scale geometry of big mapping class groups (2019, background): “olean algebras.2 Ketonen [10] gives some description and some isomorphism invariants; however, in practice, these are dicult to use, despite being a \simplest possible" description, as shown in [4]. Our denition of the partial order 4allows us to sidestep the worst of these issues. For technica”
- Complete analytic equivalence relations (2005, background): “For the other relation, we will use a construction by S. Gao in [7] to reduce ⊆F2,t[F2]ω to ⊆ F2,c Sg(F2) .”