Complexity of some natural problems on the class of computable I-algebras
- 19 Downloads
We study computable Boolean algebras with distinguished ideals (I-algebras for short). We prove that the isomorphism problem for computable I-algebras is Σ 1 1 -complete and show that the computable isomorphism problem and the computable categoricity problem for computable I-algebras are Σ 3 0 -complete.
Keywordscomputable Boolean algebra with distinguished ideals computable isomorphism computably categorical structure arithmetical complexity analytical complexity
Unable to display preview. Download preview PDF.
- 2.Goncharov S. S. and Ershov Yu. L., Constructive Models, Consultants Bureau, New York, NY (2000).Google Scholar
- 3.Ershov Yu. L. and Goncharov S. S., “Elementary theories and their constructive models,” in: Handbook of Recursive Mathematics. Vol. 1, North-Holland, Amsterdam (1998) (Stud. Logic Found. Math.; V. 138).Google Scholar
- 4.Goncharov S. S., Countable Boolean Algebras and Decidability, Plenum, New York, NY (1997).Google Scholar