Categoricity for Primitive Recursive and Polynomial Boolean Algebras › Research Explorer

Novosibirsk State University's Research Portal

Categoricity for Primitive Recursive and Polynomial Boolean Algebras

Research output: Contribution to journal › Article › peer-review

Section of Algebra and Mathematical Logic

DOI

https://doi.org/10.1007/s10469-018-9498-1
Final published version

P. E. Alaev

Original language	English
Pages (from-to)	251-274
Number of pages	24
Journal	Algebra and Logic
Volume	57
Issue number	4
DOIs	https://doi.org/10.1007/s10469-018-9498-1
Publication status	Published - 1 Sept 2018

Research areas

Boolean algebra, Boolean algebra computable in polynomial time, computable presentation, primitive recursively categorical Boolean algebra, COMPLEXITY, TIME

OECD FOS+WOS

ID: 17515544