Strong constructivizability of countable saturated Boolean algebras

DOI10.1007/BF01980754zbMath0526.03016OpenAlexW2075347833MaRDI QIDQ594859

Andrey S. Morozov

Publication date: 1983

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

Full work available at URL: https://eudml.org/doc/187175

zbMATH Keywords

countable Boolean algebraErshov-Tarski invariantssaturated Boolean algebra

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Models with special properties (saturated, rigid, etc.) (03C50) Logical aspects of Boolean algebras (03G05) Computable structure theory, computable model theory (03C57)

Related Items (1)

Boolean algebras, Tarski invariants, and index sets

Cites Work

• Recursive prime models for Boolean algebras

This page was built for publication: Strong constructivizability of countable saturated Boolean algebras