Boolean algebras autostable relative to n-decidable presentations

DOI10.1007/S10469-023-09698-YzbMATH Open1515.03161MaRDI QIDQ6160499FDOQ6160499

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

• Title not available (Why is that?)
• Autostability of models
• Recursive isomorphism types of recursive Boolean algebras
• Title not available (Why is that?)
• Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
• Recursive prime models for Boolean algebras
• 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

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)