Computably categorical Boolean algebras enriched by ideals and atoms
type: Item
instance of: scholarly article
title: Computably categorical Boolean algebras enriched by ideals and atoms
zbMATH Open document ID: 1247.03057
author: P. E. Alaev
published in: Annals of Pure and Applied Logic
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 06E75
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 6014275
zbMATH Keywords: Boolean algebras
zbMATH Keywords: computability
zbMATH Keywords: computable structures
zbMATH Keywords: computably categorical structures
MaRDI profile type: Publication
full work available at URL: j.apal.2011.06.007
OpenAlex ID: W2009381700
cites work: Autostable I-Algebras
cites work: Autostability of models
cites work: Every Low Boolean Algebra is Isomorphic to a Recursive One
cites work: Recursive isomorphism types of recursive Boolean algebras
cites work: Q3994998
cites work: Autostability of Boolean algebras with distinguished ideal
cites work: Every Low 2 Boolean Algebra has a Recursive Copy
cites work: Computable Boolean algebras
cites work: Q5596792
cites work: Countably-categorical Boolean algebras with distinguished ideals
cites work: Countably categorical and autostable Boolean algebras with distinguished ideals
cites work: Q3130249
DOI: 10.1016/J.APAL.2011.06.007
description: scientific article; zbMATH DE number 6014275