Degrees of Autostability for Prime Boolean Algebras

N. A. Bazhenov, M. I. Marchuk

Результат исследования: Научные публикации в периодических изданияхстатья

Аннотация

We look at the concept of algorithmic complexity of isomorphisms between computable copies of Boolean algebras. Degrees of autostability are found for all prime Boolean algebras. It is shown that for any ordinals α and β with the condition 0 ≤ α ≤ β ≤ ω, there is a decidable model for which 0(α) is a degree of autostability relative to strong constructivizations, while 0(β) is a degree of autostability. It is proved that for any nonzero ordinal β ≤ ω, there is a decidable model for which there is no degree of autostability relative to strong constructivizations, while 0(β) is a degree of autostability.

Язык оригиналаанглийский
Страницы (с-по)98-114
Число страниц17
ЖурналAlgebra and Logic
Том57
Номер выпуска2
DOI
СостояниеОпубликовано - 1 июн 2018

Fingerprint Подробные сведения о темах исследования «Degrees of Autostability for Prime Boolean Algebras». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать