Classifying countable Boolean terms

DOI10.1007/S10469-005-0011-2zbMath1104.03042OpenAlexW2003802196MaRDI QIDQ5393766

Victor L. Selivanov

Publication date: 24 October 2006

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-005-0011-2

zbMATH Keywords

Borel hierarchyWadge hierarchycountable Boolean termHausdorff difference hierarchy

Mathematics Subject Classification ID

Descriptive set theory (03E15) Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (4)

Towards a descriptive set theory for domain-like structures ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the main scientific achievements of Victor Selivanov ⋮ Boole vs Wadge: comparing two basic tools of descriptive set theory

This page was built for publication: Classifying countable Boolean terms