Categoricity for primitive recursive and polynomial Boolean algebras

DOI10.1007/s10469-018-9498-1zbMath1485.03102OpenAlexW2901392137MaRDI QIDQ1731520

P. E. Alaev

Publication date: 13 March 2019

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

Full work available at URL: https://doi.org/10.1007/s10469-018-9498-1

zbMATH Keywords

Boolean algebracomputable presentationBoolean algebra computable in polynomial timeprimitive recursively categorical Boolean algebra

Mathematics Subject Classification ID

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

Related Items (9)

Constructing punctually categorical semigroups ⋮ Punctual copies of algebraic structures ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Punctually presented structures I: Closure theorems ⋮ Online presentations of finitely generated structures ⋮ Primitively recursively categorical linear orderings ⋮ Primitive recursive fields and categoricity ⋮ Primitively recursive categoricity for unars and equivalence structures ⋮ Finitely generated structures computable in polynomial time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and uniqueness of structures computable in polynomial time
• Algebraic structures computable without delay
• Autostability of models
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Some properties of the constructivization of Boolean algebras
• Autostability and computable families of constructivizations
• Complexity and categoricity
• Structures computable in polynomial time. I
• Recursive isomorphism types of recursive Boolean algebras

This page was built for publication: Categoricity for primitive recursive and polynomial Boolean algebras