Arithmetic complexity of first-order definable subsets of recursive Boolean algebras

zbMath0917.03018MaRDI QIDQ1284381

S. Yu. Podzorov

Publication date: 26 April 1999

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

arithmetic complexityarithmetic hierarchyrecursive Boolean algebrasdense Boolean algebrasprime Boolean algebrassaturated Boolean algebras

Mathematics Subject Classification ID

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

This page was built for publication: Arithmetic complexity of first-order definable subsets of recursive Boolean algebras