Categoricity for primitive recursive and polynomial Boolean algebras
type: Item
instance of: scholarly article
title: Categoricity for primitive recursive and polynomial Boolean algebras
zbMATH Open document ID: 1485.03102
author: P. E. Alaev
published in: Algebra and Logic
publication date: 2019-03-13T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C35
Mathematics Subject Classification ID: 06E05
zbMATH DE Number: 7035850
zbMATH Keywords: Boolean algebra
zbMATH Keywords: Boolean algebra computable in polynomial time
zbMATH Keywords: computable presentation
zbMATH Keywords: primitive recursively categorical Boolean algebra
MaRDI profile type: Publication
full work available at URL: s10469-018-9498-1
OpenAlex ID: W2901392137
cites work: Existence and uniqueness of structures computable in polynomial time
cites work: Structures computable in polynomial time. I
cites work: Q4249365
cites work: Q4005059
cites work: Algebraic structures computable without delay
cites work: Autostability of models
cites work: Recursive isomorphism types of recursive Boolean algebras
cites work: Autostability and computable families of constructivizations
cites work: Polynomial-time Abelian groups
cites work: Q4895321
cites work: Q4091421
cites work: Some properties of the constructivization of Boolean algebras
cites work: Complexity and categoricity
cites work: Polynomial-time versus recursive models
DOI: 10.1007/S10469-018-9498-1
description: scientific article; zbMATH DE number 7035850