Autostability of Boolean algebras with distinguished ideal

DOI10.1007/BF02672914zbMath0913.06011MaRDI QIDQ1288130

N. T. Kogabaev

Publication date: 11 May 1999

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Boolean algebra with distinguished idealautostable modelrecursively categorical model

Mathematics Subject Classification ID

Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Autostable atomic-ideal enrichments of computable Boolean algebras ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ Computably categorical Boolean algebras enriched by ideals and atoms

Cites Work

• Unnamed Item
• Algorithmic properties of branching models
• Undecidability of theories of Boolean algebras with selected ideals
• Countably-categorical Boolean algebras with distinguished ideals
• Autostability of models

This page was built for publication: Autostability of Boolean algebras with distinguished ideal