Mar 17, 2016 · We investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished modalities).

Definition 1. Let d be a Turing degree. A computable structure A is d- computably categorical if for every computable structure B isomorphic to A,.

Nov 21, 2015 · Abstract. We investigate effective categoricity for polymodal algebras (i.e., Boolean al- gebras with distinguished modalities).

2016 Springer Science+Business Media DordrechtWe investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished ...

We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, ...

Bazhenov, Nikolay · We investigate effective categoricity for polymodal algebras (i.e., Boolean algebras with distinguished modalities). · Studia Logica, 2016, ...

Categoricity Spectra for Polymodal Algebras · DOI · OECD FOS+WOS · Research areas · State classification of scientific and technological information.

Categoricity Spectra for Polymodal Algebras. N Bazhenov. Studia Logica 104 (6), 1083-1097, 2016. 13, 2016. Degrees of categoricity vs. strong degrees of ...

Categoricity spectra for polymodal algebras, Studia Logica, 2016, 104:6 ... English translation: 2-computably enumerable degrees of categoricity for Boolean ...

Categoricity Spectra for Polymodal Algebras. N Bazhenov. Studia Logica 104 (6), 1083-1097, 2016. 13, 2016. Degrees of categoricity vs. strong degrees of ...