Categoricity spectra for polymodal algebras

DOI10.1007/s11225-016-9667-yzbMath1417.03233OpenAlexW2301374258MaRDI QIDQ514501

Nikolay Bazhenov

Publication date: 2 March 2017

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-016-9667-y

zbMATH Keywords

categoricity spectrumTuring computable embeddingautostability spectrumBoolean algebra with operatorsdegree spectrumpolymodal algebra

Mathematics Subject Classification ID

Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Categoricity and completeness of theories (03C35)

Related Items (5)

Effective categoricity for distributive lattices and Heyting algebras ⋮ On the effective universality of mereological theories ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ HKSS-completeness of modal algebras ⋮ Categoricity spectra of computable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computable categoricity
• Computable isomorphisms of Boolean algebras with operators
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Degrees of categoricity and the hyperarithmetic hierarchy
• Using computability to measure complexity of algebraic structures and classes of structures
• Autostability spectra for Boolean algebras
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of computable structures
• Limitwise monotonic sequences and degree spectra of structures
• A Borel reductibility theory for classes of countable structures
• Effective procedures in field theory
• d-computable categoricity for algebraic fields
• Degrees coded in jumps of orderings
• Algebraic polymodal logic: a survey
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• CONSTRUCTIVE ALGEBRAS I
• Turing computable embeddings
• Comparing Classes of Finite Structures
• 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
• The theory of projective planes is complete with respect to degree spectra and effective dimensions

This page was built for publication: Categoricity spectra for polymodal algebras