Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
