Boolean algebras autostable relative to n-decidable presentations

DOI10.1007/S10469-023-09698-YMaRDI QIDQ6160499zbMATH OpenFDO

Authors M. N. Gaskova

Publication date 10 May 2023

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

zbMATH Keywords

Boolean algebraautostabilitycomputable categoricitycomputable structureprime model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Structure theory of Boolean algebras (06E05)

Cites work

• scientific article; zbMATH DE number 42239 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• Autostability of models
• Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
• Autostable atomic-ideal enrichments of computable Boolean algebras
• Computably categorical Boolean algebras enriched by ideals and atoms
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
• Recursive isomorphism types of recursive Boolean algebras
• Recursive prime models for Boolean algebras

Cited in

(1)

• The index set of Boolean algebras autostable relative to strong constructivizations

This page was built for publication: Boolean algebras autostable relative to \(n\)-decidable presentations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160499)