Categoricity spectra for polymodal algebras

DOI10.1007/S11225-016-9667-YMaRDI QIDQ514501zbMATH OpenOpenAlexFDO

Authors 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

Turing computable embeddingcategoricity spectrumautostability spectrumBoolean algebra with operatorsdegree spectrumpolymodal algebra

Mathematics Subject Classification ID

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

Recommendations

• Computable isomorphisms of Boolean algebras with operators
• Algebraic polymodal logic: a survey
• Complexity of the universal theory of modal algebras
• A categorical approach to polyadic algebras
• Categoricity for primitive recursive and polynomial Boolean algebras

Cites work

• scientific article; zbMATH DE number 1531926 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3250559 (Why is no real title available?)
• 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
• A Borel reductibility theory for classes of countable structures
• A computable functor from graphs to fields
• Algebraic polymodal logic: a survey
• Autostability of models
• Autostability spectra for Boolean algebras
• CONSTRUCTIVE ALGEBRAS I
• Comparing Classes of Finite Structures
• Computable isomorphisms of Boolean algebras with operators
• Computable structures and the hyperarithmetical hierarchy
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Degree spectra and computable dimensions in algebraic structures
• Degrees coded in jumps of orderings
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• Limitwise monotonic sequences and degree spectra of structures
• The complexity of computable categoricity
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Turing computable embeddings
• Using computability to measure complexity of algebraic structures and classes of structures
• \(d\)-computable categoricity for algebraic fields

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514501)